#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define s second
#define f first
#define left (node<<1),l,((l+r)>>1)
#define right ((node<<1)|1),((l+r)>>1) + 1,r
#define int ll
using namespace std;
const int N = 1e5 + 5;
int a[N];
signed main() {
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
int T;
cin>>T;
while (T--){
int n; ll k;
cin>>n>>k;
ll sum=0;
for (int i = 1; i <= n; i++){
cin>>a[i];
sum += a[i];
}
if (sum&1){
cout<<'1';
continue;
}
int p = 0;
for (ll i = 2; i <= k; i *= 2){
ll cnt=0;
for (int j = 1; j<= n; j++){
cnt += a[j]/i;
}
if (cnt & 1){
p = 1;
break;
}
}
if (p) cout<<'1';
else cout<<'0';
}
}
/*
2
1 2
8
1 4
12
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
488 KB |
Output is correct |
2 |
Correct |
8 ms |
468 KB |
Output is correct |
3 |
Correct |
8 ms |
468 KB |
Output is correct |
4 |
Correct |
8 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
340 KB |
Output is correct |
2 |
Correct |
6 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
340 KB |
Output is correct |
2 |
Correct |
15 ms |
472 KB |
Output is correct |
3 |
Correct |
15 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
26 ms |
392 KB |
Output is correct |
2 |
Correct |
27 ms |
472 KB |
Output is correct |
3 |
Correct |
27 ms |
496 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
468 KB |
Output is correct |
2 |
Correct |
9 ms |
488 KB |
Output is correct |
3 |
Correct |
9 ms |
488 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
468 KB |
Output is correct |
2 |
Correct |
11 ms |
576 KB |
Output is correct |
3 |
Correct |
19 ms |
492 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
480 KB |
Output is correct |
2 |
Correct |
16 ms |
488 KB |
Output is correct |