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>
#define int long long
using namespace std;
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif
const int N = 10;
int n, k;
int a[N];
int bt(int i, int la) {
if (i == n) {
return 0;
}
if (a[i] == 0) {
return bt(i+1, la);
}
bool ret = 0;
for (int j = 1; j <= min(la, a[i]); ++j) {
a[i] -= j;
ret |= (bt(i, j) == 0);
a[i] += j;
}
return ret;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while(t--) {
cin >> n >> k;
int sum = 0;
int twos = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
twos += a[i] / 2;
}
if (sum & 1LL) {
cout << 1;
}
else if(k == 2) {
cout << (twos & 1);
}
else if (n <= 10){
cout << bt(0, k);
}
else {
cout << 0;
}
}
return 0;
}
# | 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... |