제출 #365877

#제출 시각아이디문제언어결과실행 시간메모리
365877aihayFootball (info1cup20_football)C++14
69 / 100
255 ms748 KiB
#pragma GCC optimize ("O3") #pragma GCC optimize ("unroll-loops") #pragma GCC optimize("-Ofast") #include <bits/stdc++.h> using namespace std; typedef int in; #define f first #define s second #define pb push_back #define pp push #define ceil(x) NEVER USE CEIL #define sqrt(x) (int)(sqrt(x)) int arr[100010]; in main() { ios_base::sync_with_stdio(0); int tc=1; cin>>tc; while(tc--) { int n,k,sum=0; cin>>n>>k; if(k==1){ for(int i=0;i<n;i++){ int x; cin>>x; sum+=x; } cout<<(sum%2?1:0); } else if(n==1){ for(int i=0;i<n;i++){ int x; cin>>x; sum+=x; } int y=1; while(sum%2==0){ sum/=2; y*=2; } cout<<(k>=y?1:0); } else{ for(int i=0;i<n;i++) cin>>arr[i]; bool ans=0; for(int i=0;(1<<i)<=k;i++){ sum=0; for(int j=0;j<n;j++) sum+=arr[j]; if(sum%2==1){ ans=1; break; } for(int i=0;i<n;i++) arr[i]/=2; } cout<<ans; } } 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...