-
Notifications
You must be signed in to change notification settings - Fork 77
/
MaximumXor.java
118 lines (97 loc) · 3.13 KB
/
MaximumXor.java
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
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class Solution {
static class BitTree {
BitTree one;
BitTree zero;
BitTree write(boolean v) {
if (v) {
if (one == null) {
one = new BitTree();
}
return one;
} else {
if (zero == null) {
zero = new BitTree();
}
return zero;
}
}
}
// Complete the maxXor function below.
static int[] maxXor(int[] arr, int[] queries) {
final BitTree tree = new BitTree();
for (int v : arr) {
BitTree h = tree;
for (int b = 0; b < 32; ++b) {
h = h.write((v & 0x80000000) != 0);
v = v << 1;
}
}
int result[] = new int[queries.length];
for (int i = 0; i < queries.length; ++i) {
int q = queries[i];
int v = 0;
BitTree h = tree;
for (int b = 0; b < 32; ++b) {
v = v << 1;
if ((q & 0x80000000) == 0) {
// Not inverted. Follow high.
if (h.one != null) {
h = h.one;
v |= 1;
} else {
h = h.zero;
}
} else {
// Inverted. Follow low.
if (h.zero != null) {
h = h.zero;
v |= 1;
} else {
h = h.one;
}
}
q= q << 1;
}
result[i] = v;
}
return result;
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int n = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int[] arr = new int[n];
String[] arrItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < n; i++) {
int arrItem = Integer.parseInt(arrItems[i]);
arr[i] = arrItem;
}
int m = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int[] queries = new int[m];
for (int i = 0; i < m; i++) {
int queriesItem = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
queries[i] = queriesItem;
}
int[] result = maxXor(arr, queries);
for (int i = 0; i < result.length; i++) {
bufferedWriter.write(String.valueOf(result[i]));
if (i != result.length - 1) {
bufferedWriter.write("\n");
}
}
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}