#include <bits/stdc++.h>
#include <functional>
#include <queue>
using namespace std;
int main() {
int T; cin >> T;
while(T--){
int N, K; cin >> N >> K;
priority_queue<int> pq;
for(int i = 0; i < N; i++){
int x; cin >> x;
pq.push(x);
}
bool turn = 0;
while(!pq.empty()){
int t = pq.top();
pq.pop();
turn = turn ^ 1;
if(t <= K){
K = t;
}
else{
int r = t % K;
if((t / K) % 2 == 1) turn = turn ^ 1;
pq.push(r);
}
}
cout << turn;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
39 ms |
616 KB |
Output is correct |
2 |
Correct |
41 ms |
1376 KB |
Output is correct |
3 |
Correct |
40 ms |
1388 KB |
Output is correct |
4 |
Correct |
39 ms |
1376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
30 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
141 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
169 ms |
508 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
41 ms |
608 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
43 ms |
604 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
57 ms |
604 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |