//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up
template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
return a + rng() % (b - a + 1);
}
#ifndef LOCAL
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl;
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;
void IO() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////
int32_t main() {
boost; IO();
int TC; cin>>TC;
while(TC--){
int N,K; cin>>N>>K;
vi a(N);
FOR(i,0,N) cin>>a[i];
/*if(K==1){
int s=0;
FOR(i,0,N) s+=a[i];
cout << (s&1);
}
else if(N==1){
int X=a[0],f=(X<=K),cur=1;
while(cur<=K){
if(X%cur==0 && (X/cur)%2==1) f=1;
cur*=2;
}
cout << f;
}
else if(K==2){
int s=0,ss=0;
FOR(i,0,N) s+=a[i],ss+=a[i]/2;
cout << (s&1 || ss&1);
}*/
int cur=1,ans=0;
while(cur<=K){
int s=0;
FOR(i,0,N) s+=a[i]/cur;
ans|=(s&1);
cur*=2;
}
cout << ans;
}
return 0;
}
//Change your approach
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
492 KB |
Output is correct |
| 2 |
Correct |
18 ms |
492 KB |
Output is correct |
| 3 |
Correct |
17 ms |
492 KB |
Output is correct |
| 4 |
Correct |
14 ms |
492 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
364 KB |
Output is correct |
| 2 |
Correct |
10 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
27 ms |
420 KB |
Output is correct |
| 2 |
Correct |
28 ms |
560 KB |
Output is correct |
| 3 |
Correct |
27 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
48 ms |
492 KB |
Output is correct |
| 2 |
Correct |
46 ms |
492 KB |
Output is correct |
| 3 |
Correct |
46 ms |
468 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
492 KB |
Output is correct |
| 2 |
Correct |
18 ms |
492 KB |
Output is correct |
| 3 |
Correct |
18 ms |
492 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
22 ms |
492 KB |
Output is correct |
| 2 |
Correct |
22 ms |
492 KB |
Output is correct |
| 3 |
Correct |
31 ms |
492 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
28 ms |
492 KB |
Output is correct |
| 2 |
Correct |
28 ms |
556 KB |
Output is correct |
