이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define OYY LLONG_MAX
#define mod 998244353
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define lim 1000005
#define fi first
#define se second
int32_t main(){
faster
int t;cin>>t;
while(t--){
int n,k;cin>>n>>k;
int dizi[n+1];
int sum=0,tut=0;
FOR{
cin>>dizi[i];
sum+=dizi[i];
tut+=dizi[i]/2;
}
if(n==1){
if(dizi[1]<=k || dizi[1]&1)cout<<"1";
else{
if(tut&1)cout<<"1";
else cout<<"0";
}
}
else if(k==1){
if(sum&1)cout<<"1";
else cout<<"0";
}
else{
if(tut&1 || sum&1)cout<<"1";
else cout<<"0";
}
}
cout<<'\n';
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... |