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;
typedef long long ll;
#define rep(a,b) for (int a = 0; a < (b); ++a)
#define pb push_back
#define all(t) t.begin(), t.end()
const int max_N = 1e5+5;
int t = 0, n = 0, k = 0;
ll sum = 0;
int A[max_N];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> t;
rep(z,t)
{
cin >> n >> k;
rep(i,n) cin >> A[i];
sum = 0;
rep(i,n) sum += A[i];
if (sum % 2 == 1)
{
cout << "1";
continue;
}
if (k == 1)
{
cout << "0";
continue;
}
sum = 0;
rep(i,n) sum += A[i] % 2;
if (sum % 2 == 0) cout << "1";
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... |