#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int tc, n, k, a[100100];
int main(){
cin.tie(0)->sync_with_stdio(0);
cin >> tc;
while(tc--) {
cin >> n >> k;
for(int i=1;i<=n;i++) cin >> a[i];
ll s = 0;
while(1) {
s = 0;
for(int i=1;i<=n;i++) s += a[i];
if(k == 1 || s % 2) break;
for(int i=1;i<=n;i++) a[i] = a[i]/2;
k /= 2;
}
cout << s%2;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
1228 KB |
Output is correct |
2 |
Correct |
10 ms |
1288 KB |
Output is correct |
3 |
Correct |
14 ms |
1284 KB |
Output is correct |
4 |
Correct |
11 ms |
1280 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 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 |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
468 KB |
Output is correct |
2 |
Correct |
8 ms |
568 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
996 KB |
Output is correct |
2 |
Correct |
24 ms |
964 KB |
Output is correct |
3 |
Correct |
26 ms |
980 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
31 ms |
2012 KB |
Output is correct |
2 |
Correct |
28 ms |
2032 KB |
Output is correct |
3 |
Correct |
35 ms |
1992 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
1252 KB |
Output is correct |
2 |
Correct |
10 ms |
1284 KB |
Output is correct |
3 |
Correct |
10 ms |
1364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
1296 KB |
Output is correct |
2 |
Correct |
17 ms |
1280 KB |
Output is correct |
3 |
Correct |
14 ms |
1364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
1364 KB |
Output is correct |
2 |
Correct |
12 ms |
1252 KB |
Output is correct |