#include <iostream>
using namespace std;
void solve () {
int n, k, res = 0, x;
cin >> n >> k;
for ( int i = 1; i <= n; i++ ) {
cin >> x;
res ^= x;
}
for ( int p = 1; p <= k; p <<= 1 )
if ( res & p ) {
cout << 1;
return;
}
cout << 0;
}
int main() {
int t;
cin >> t;
while ( t-- )
solve ();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
40 ms |
1228 KB |
Output is correct |
2 |
Correct |
41 ms |
1176 KB |
Output is correct |
3 |
Correct |
40 ms |
1228 KB |
Output is correct |
4 |
Correct |
39 ms |
1180 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
27 ms |
476 KB |
Output is correct |
2 |
Correct |
27 ms |
544 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
145 ms |
916 KB |
Output is correct |
2 |
Correct |
154 ms |
1068 KB |
Output is correct |
3 |
Correct |
146 ms |
1060 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
192 ms |
1996 KB |
Output is correct |
2 |
Correct |
189 ms |
1948 KB |
Output is correct |
3 |
Correct |
189 ms |
1948 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
40 ms |
1208 KB |
Output is correct |
2 |
Correct |
42 ms |
1184 KB |
Output is correct |
3 |
Correct |
41 ms |
1172 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
43 ms |
1176 KB |
Output is correct |
2 |
Correct |
40 ms |
1172 KB |
Output is correct |
3 |
Correct |
40 ms |
1200 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
43 ms |
1160 KB |
Output is correct |
2 |
Correct |
43 ms |
1164 KB |
Output is correct |