-
Notifications
You must be signed in to change notification settings - Fork 0
/
Construct list using q XOR queries
96 lines (78 loc) · 2.39 KB
/
Construct list using q XOR queries
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
//Construct list using q XOR queries
import java.io.*;
import java.util.*;
class IntMatrix {
public static int[][] input(BufferedReader br, int n, int m) throws IOException {
int[][] mat = new int[n][];
for(int i = 0; i < n; i++) {
String[] s = br.readLine().trim().split(" ");
mat[i] = new int[s.length];
for(int j = 0; j < s.length; j++)
mat[i][j] = Integer.parseInt(s[j]);
}
return mat;
}
public static void print(int[][] m) {
for(var a : m) {
for(int e : a)
System.out.print(e + " ");
System.out.println();
}
}
public static void print(ArrayList<ArrayList<Integer>> m) {
for(var a : m) {
for(int e : a)
System.out.print(e + " ");
System.out.println();
}
}
}
class IntArray {
public static int[] input(BufferedReader br, int n) throws IOException {
String[] s = br.readLine().trim().split(" ");
int[] a = new int[n];
for(int i = 0; i < n; i++)
a[i] = Integer.parseInt(s[i]);
return a;
}
public static void print(int[] a) {
for(int e : a)
System.out.print(e + " ");
System.out.println();
}
public static void print(ArrayList<Integer> a) {
for(int e : a)
System.out.print(e + " ");
System.out.println();
}
}
class GFG {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int t = Integer.parseInt(br.readLine());
while(t-- > 0) {
int q = Integer.parseInt(br.readLine());
int[][] queries = IntMatrix.input(br, q, 2);
Solution obj = new Solution();
ArrayList<Integer> res = obj.constructList(q, queries);
IntArray.print(res);
}
}
}
class Solution {
public static ArrayList<Integer> constructList(int q, int[][] queries) {
int x = 0;
ArrayList<Integer> ans = new ArrayList<>();
for(int i = q - 1; i >= 0; i--) {
if(queries[i][0] == 1) {
x ^= queries[i][1];
}
else {
ans.add(queries[i][1] ^ x);
}
}
ans.add(x);
Collections.sort(ans);
return ans;
}
}