oj.uz

Submission #365915

# Submission time Handle Problem Language Result Execution time Memory
365915 2021-02-12T13:57:07 Z Ahmadsm2005 Football (info1cup20_football) C++14
100 / 100
 45 ms 748 KB 
#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;
}

Subtask #1
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 748 KB Output is correct
2 Correct 15 ms 748 KB Output is correct
3 Correct 15 ms 748 KB Output is correct
4 Correct 17 ms 748 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 364 KB Output is correct
2 Correct 10 ms 364 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 364 KB Output is correct
2 Correct 26 ms 364 KB Output is correct
3 Correct 26 ms 364 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 492 KB Output is correct
2 Correct 42 ms 492 KB Output is correct
3 Correct 43 ms 492 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 748 KB Output is correct
2 Correct 14 ms 748 KB Output is correct
3 Correct 14 ms 748 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 748 KB Output is correct
2 Correct 16 ms 748 KB Output is correct
3 Correct 26 ms 748 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 748 KB Output is correct
2 Correct 24 ms 748 KB Output is correct