This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int t;
cin >> t;
while(t --) {
int n, k;
cin >> n >> k;
vector <int> a(n);
for(int i = 0; i < n; i ++) cin >> a[i];
if(n == 1) {
if(a[0] % 2 == 1) {
cout << 1;
}else cout << 0 ;
continue;
}
if(k == 1) {
int sum = accumulate(a.begin(), a.end(), 0ll);
if(sum % 2 == 1) {
cout << 1;
}else cout << 0;
continue;
}
int sum = count(a.begin(), a.end(), 1) + count(a.begin(), a.end(), 3);
int move = count(a.begin(), a.end(), 2) + count(a.begin(), a.end(), 3);
if(move % 2 == 0) {
if(sum % 2 == 1) {
cout << 1;
}else cout << 0;
}else {
if(sum % 2 == 0) cout << 1;
else cout << 0;
}
}
return false;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |