-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution7.java
More file actions
155 lines (127 loc) · 4.99 KB
/
Copy pathSolution7.java
File metadata and controls
155 lines (127 loc) · 4.99 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
import java.util.ArrayList;
import java.util.List;
public class Solution7 {
static double eps=Math.pow(10,-9);
public static boolean check(int a, int b)
{
int max,min;
if(a>b)
{
max = a;
min = b;
}
else
{
max = b;
min = a;
}
double checkingCriteria = (double) max / (double) min + 1f;
double log = Math.log(checkingCriteria) / Math.log(2f);
double truncatedValue = Math.floor(log);
//System.out.println(log+" "+truncatedValue);
if(Math.abs(log-truncatedValue)<eps)
{
return false; //cannot be a pair
}
else
{
return true; // can be a pair
}
}
public static int solution(int[] banana_list) {
int n=banana_list.length;
List<List<Integer>> edge_list = new ArrayList<List<Integer>>(n);
for(int i=0; i<n; i++)
{
List<Integer> edge = new ArrayList<Integer>();
for(int j=0; j<n; j++)
{
if(check(banana_list[i],banana_list[j]))
{
edge.add(j);
}
//System.out.println(banana_list[i]+" "+banana_list[j]+" "+check(banana_list[i],banana_list[j]));
}
edge_list.add(edge);
}
/*System.out.println(edge_list.get(0).remove(edge_list.get(0).indexOf(3)));
for(int i=0; i<n; i++)
{
System.out.println(i+": ");
for(int j=0; j<edge_list.get(i).size(); j++)
{
System.out.println(edge_list.get(i).get(j));
}
System.out.println();
}
*/
boolean valid = true;
int ans = n;
while (valid)
{
int min_edge = 100, idx_min = -1;
for(int i=0; i<n; i++)
{
//System.out.println(edge_list.get(i).size());
int list_size_now = edge_list.get(i).size();
if(min_edge>list_size_now && list_size_now>0)
{
min_edge = list_size_now;
idx_min = i;
}
}
if(idx_min == -1)
{
valid = false;
}
else
{
int neighbour_min_edge = 100, idx_neighbour_min = -1;
for(int i=0; i<edge_list.get(idx_min).size(); i++)
{
int list_size_neighbouring_edge_now = edge_list.get(edge_list.get(idx_min).get(i)).size();
if(neighbour_min_edge>list_size_neighbouring_edge_now && list_size_neighbouring_edge_now>0)
{
neighbour_min_edge = list_size_neighbouring_edge_now;
idx_neighbour_min = edge_list.get(idx_min).get(i);
}
}
//System.out.println(neighbour_min_edge+" "+idx_neighbour_min);
//removing neigbour and current edge
ans-=2;
/*System.out.println(edge_list.get(0).remove(edge_list.get(0).indexOf(3)));*/
//removing idx_min from its neighbouring node
for(int i=0; i<edge_list.get(idx_min).size(); i++)
{
//System.out.println(edge_list.get(idx_min).get(i));
edge_list.get(edge_list.get(idx_min).get(i)).remove(edge_list.get(edge_list.get(idx_min).get(i)).indexOf(idx_min));
}
//removing idx_neighbour_min from its neighbouring node
for(int i=0; i<edge_list.get(idx_neighbour_min).size(); i++)
{
//System.out.println(edge_list.get(idx_neighbour_min).get(i));
edge_list.get(edge_list.get(idx_neighbour_min).get(i)).remove(edge_list.get(edge_list.get(idx_neighbour_min).get(i)).indexOf(idx_neighbour_min));
}
//removing all idx_min neighbour
edge_list.get(idx_min).clear();
//removing all idx_neigbour_min neighbour
edge_list.get(idx_neighbour_min).clear();
}
}
/*for(int i=0; i<n; i++)
{
System.out.println(i+": ");
for(int j=0; j<edge_list.get(i).size(); j++)
{
System.out.println(edge_list.get(i).get(j));
}
System.out.println();
}*/
return ans;
}
public static void main(String[] args)
{
System.out.println(Solution7.solution(new int[] {1,1}));
//System.out.println(check(6,6));
}
}