Submission #365915

#TimeUsernameProblemLanguageResultExecution timeMemory
365915Ahmadsm2005Football (info1cup20_football)C++14
100 / 100
45 ms748 KiB
#include <bits/stdc++.h> //#define endl '\n' #define modulo 998244353 #define int long long #define PI acos(-1) #pragma GCC optimize("-Ofast") #pragma GCC optimize("trapv") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native") #pragma GCC optimize("-ffast-math") #pragma GCC optimize("-funroll-loops") #pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops") #define sinDegrees(x) sin((x) * PI / 180.0) #define cosDegrees(x) cos((x) * PI / 180.0) #define tanDegrees(x) tan((x) * PI / 180.0) #define atanDegrees(x) atan(x)* 180.0 / PI #define asinDegrees(x) asin(x)* 180.0 / PI #define EPS 0.000000001 using namespace std; int power(int x,int y,int m) { int temp; if(y == 0) return 1; temp = (power(x, y/2,m))%m; if (y%2 == 0) return ((temp%m)*temp); else return ((x*temp%m)*temp%m)%m; } int inv(int x,int m=modulo) { return (power(x,m-2,m))%m; } ///IOI 2021 isA int N,K,C,X; vector<int>lolz; int32_t main() { //freopen("output.txt","w",stdout); //freopen("sorting.in","r",stdin); cin.tie(0),iostream::sync_with_stdio(0); int testcases; cin>>testcases; while(testcases--){ C=0; cin>>N>>K; for(int i=0;i<N;i++){ cin>>X; lolz.push_back(X); C+=X; } if(C%2){ cout<<1; } else{ int Z=2; while(Z<=K){ int AA=0; for(int i=0;i<N;i++){ AA+=lolz[i]/Z; } if(AA%2){ cout<<1; goto a; } Z*=2; } cout<<0; goto a; } a:; lolz.clear(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...