# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
369863 | 2021-02-22T16:23:56 Z | A_D | Football (info1cup20_football) | C++14 | 288 ms | 2156 KB |
#include <bits/stdc++.h> #define int long long #define ii pair<int,int> #define F first #define S second #define du long double using namespace std; const int N=1e6+100; int a[N]; int n; bool solve(int k) { if(k==0)return 0; int sum=0; for(int i=1;i<=n;i++){ sum+=a[i]; } for(int i=1;i<=n;i++)a[i]/=2; if(sum&1)return 1; else return solve(k/2); } void qqqq() { int k; cin>>n>>k; for(int i=1;i<=n;i++){ scanf("%lld",&a[i]); } cout<<solve(k); } main() { int t; cin>>t; while(t--)qqqq(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 1516 KB | Output is correct |
2 | Correct | 20 ms | 1516 KB | Output is correct |
3 | Correct | 20 ms | 1516 KB | Output is correct |
4 | Correct | 20 ms | 1516 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 37 ms | 628 KB | Output is correct |
2 | Correct | 36 ms | 620 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 248 ms | 1080 KB | Output is correct |
2 | Correct | 260 ms | 1132 KB | Output is correct |
3 | Correct | 255 ms | 1132 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 287 ms | 2064 KB | Output is correct |
2 | Correct | 288 ms | 2076 KB | Output is correct |
3 | Correct | 284 ms | 2156 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 1516 KB | Output is correct |
2 | Correct | 21 ms | 1516 KB | Output is correct |
3 | Correct | 24 ms | 1516 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 23 ms | 1516 KB | Output is correct |
2 | Correct | 21 ms | 1516 KB | Output is correct |
3 | Correct | 22 ms | 1516 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 24 ms | 1516 KB | Output is correct |
2 | Correct | 24 ms | 1516 KB | Output is correct |