이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma GCC optimize("O3,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000007
int n,k;
int a[100001];
bool verif1()
{
int sum=0;
for(int i=1;i<=n;i++)
sum+=a[i];
if(sum%2==1)
return 1;
return 0;
}
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
int t;
cin>>t;
while(t--)
{
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+1+n);
if(verif1())
{
cout<<1;
continue;
}
///suma elementelor este para
if(k==1)
{
cout<<0;
continue;
}
if(k==2 || k==3)
{
///la o runda pot sa ia doar 2 elevi din oricare gramada
int sum2=0;
for(int i=1;i<=n;i++)
sum2+=a[i] - (a[i]%2);
sum2/=2;
if(sum2%2==1)
{
cout<<1;
continue;
}
cout<<0;
continue;
}
if(n==1)
{
///a[1]%2==0
if(k>=a[1])
{
cout<<1;
continue;
}
int cv=2;
bool bl=0;
while(cv<=min(k,a[1]))
{
if((a[1]/cv)%2==1)
{
bl=1;
break;
}
cv=cv*2;
}
if(bl)
{
cout<<1;
continue;
}
cout<<0;
continue;
}
}
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... |