#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int main(){
fastIO;
int tc;
cin >> tc;
for(int ti = 1; ti <= tc; ti ++ ){
int n;
ll k;
cin >> n >> k;
vector<ll> x(n);
for(int i = 0 ;i < n; i ++ ){
cin >> x[i];
}
ll cc;
bool who = false;
ll cum;
for(int lg = 0; lg < 32; lg ++ ){
cc = (1 << lg);
if(cc <= k){
cum = 0;
for(int i = 0 ; i < n; i ++) {
cum += x[i] / cc;
}
if(cum % 2 == 1){
who = true;
break;
}
}
}
if(who){
cout << "1";
}
else{
cout << "0";
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
1100 KB |
Output is correct |
2 |
Correct |
13 ms |
1100 KB |
Output is correct |
3 |
Correct |
13 ms |
1100 KB |
Output is correct |
4 |
Correct |
14 ms |
1100 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
620 KB |
Output is correct |
2 |
Correct |
10 ms |
620 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
36 ms |
1004 KB |
Output is correct |
2 |
Correct |
32 ms |
1132 KB |
Output is correct |
3 |
Correct |
37 ms |
1132 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
57 ms |
1056 KB |
Output is correct |
2 |
Correct |
42 ms |
2156 KB |
Output is correct |
3 |
Correct |
43 ms |
2156 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
1100 KB |
Output is correct |
2 |
Correct |
15 ms |
1100 KB |
Output is correct |
3 |
Correct |
16 ms |
1100 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
1100 KB |
Output is correct |
2 |
Correct |
19 ms |
1484 KB |
Output is correct |
3 |
Correct |
27 ms |
1484 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
1100 KB |
Output is correct |
2 |
Correct |
25 ms |
1484 KB |
Output is correct |