-
Notifications
You must be signed in to change notification settings - Fork 0
/
Construct list using given q XOR queries.cpp
91 lines (74 loc) · 1.84 KB
/
Construct list using given q XOR queries.cpp
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
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
class Matrix {
public:
template <class T>
static void input(vector<vector<T>> &A, int n, int m) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d ", &A[i][j]);
}
}
}
template <class T>
static void print(vector<vector<T>> &A) {
for (int i = 0; i < A.size(); i++) {
for (int j = 0; j < A[i].size(); j++) {
cout << A[i][j] << " ";
}
cout << endl;
}
}
};
class Array {
public:
template <class T>
static void input(vector<T> &A, int n) {
for (int i = 0; i < n; i++) {
scanf("%d ", &A[i]);
}
}
template <class T>
static void print(vector<T> &A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
};
// } Driver Code Ends
class Solution {
public:
vector<int> constructList(int q, vector<vector<int>> &queries) {
// code here
vector<int>ans;
ans.push_back(0);
for(int i=0;i<queries.size();i++){
if(queries[i][0]==0) ans.push_back(queries[i][1]);
else {
int x=queries[i][1];
for(int i=0;i<ans.size();i++){
ans[i]=ans[i]^x;
}
}
}
sort(ans.begin(),ans.end());
return ans;
}
};
//{ Driver Code Starts.
int main() {
int t;
scanf("%d ", &t);
while (t--) {
int q;
scanf("%d", &q);
vector<vector<int>> queries(q, vector<int>(2));
Matrix::input(queries, q, 2);
Solution obj;
vector<int> res = obj.constructList(q, queries);
Array::print(res);
}
}
// } Driver Code Ends