#include <iostream>
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(0)
#define lli long long int
#define nl "\n"
#define rep(i, a, b) for(lli i = (a); i <= (b); ++i)
#define debugsl(x) cout << #x << " = " << x << ", "
#define debug(x) debugsl(x) << endl
#define debugarr(x, a, b) cout << #x << " = ["; rep(i, a, b){ cout << x[i] << ", "; } cout << "]" << nl
#define MAXN 100003
lli t, n, k, a[MAXN], suma, paridad, pot;
int main()
{
fastio;
cin >> t;
while(t--){
cin >> n >> k;
rep(i, 1, n) cin >> a[i];
pot = 1;
while (pot <= k){
suma = 0;
rep(i, 1, n) suma += a[i] / pot;
if (suma & 1) break;
pot <<= 1;
}
cout << (suma & 1);
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
484 KB |
Output is correct |
2 |
Correct |
12 ms |
1360 KB |
Output is correct |
3 |
Correct |
13 ms |
1360 KB |
Output is correct |
4 |
Correct |
17 ms |
1356 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
332 KB |
Output is correct |
2 |
Correct |
9 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
384 KB |
Output is correct |
2 |
Correct |
29 ms |
1124 KB |
Output is correct |
3 |
Correct |
21 ms |
1052 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
38 ms |
332 KB |
Output is correct |
2 |
Correct |
52 ms |
2040 KB |
Output is correct |
3 |
Correct |
38 ms |
1992 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
460 KB |
Output is correct |
2 |
Correct |
13 ms |
1348 KB |
Output is correct |
3 |
Correct |
16 ms |
1452 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
476 KB |
Output is correct |
2 |
Correct |
16 ms |
1360 KB |
Output is correct |
3 |
Correct |
26 ms |
1444 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
460 KB |
Output is correct |
2 |
Correct |
27 ms |
1360 KB |
Output is correct |