#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;
}
bool isput2(int x)
{
int put=1;
while(put<x)
put=put*2;
if(put==x)
return 1;
return 0;
}
signed main()
{
ios_base::sync_with_stdio(0);cin.tie(0);
int t;
cin>>t;
while(t--)
{
cin>>n>>k;
int mxm=0;
for(int i=1;i<=n;i++)
cin>>a[i],mxm=max(mxm,a[i]);
k = min(k,mxm);
bool bl=0;
while(k>0)
{
int aux=0;
for(int i=1;i<=n;i++)
{
aux+=a[i];
a[i]/=2;
}
if(aux%2==1)
{
bl=1;
break;
}
k/=2;
}
if(bl)
cout<<1;
else
cout<<0;
}
return 0;
}
/**
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
468 KB |
Output is correct |
2 |
Correct |
9 ms |
484 KB |
Output is correct |
3 |
Correct |
10 ms |
468 KB |
Output is correct |
4 |
Correct |
15 ms |
480 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
340 KB |
Output is correct |
2 |
Correct |
6 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
344 KB |
Output is correct |
2 |
Correct |
19 ms |
412 KB |
Output is correct |
3 |
Correct |
18 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
29 ms |
388 KB |
Output is correct |
2 |
Correct |
39 ms |
456 KB |
Output is correct |
3 |
Correct |
29 ms |
336 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
480 KB |
Output is correct |
2 |
Correct |
9 ms |
468 KB |
Output is correct |
3 |
Correct |
9 ms |
484 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
468 KB |
Output is correct |
2 |
Correct |
14 ms |
488 KB |
Output is correct |
3 |
Correct |
11 ms |
492 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
14 ms |
484 KB |
Output is correct |
2 |
Correct |
14 ms |
488 KB |
Output is correct |