Submission #1145245

#	Time	Username	Problem	Language	Result	Execution time	Memory
1145245		dobri_oke	Football (info1cup20_football)	C++20	100 / 100	21 ms	652 KiB

football

//#pragma GCC target ("avx2")   
//#pragma GCC optimize ("Ofast")   
#include <bits/stdc++.h>   
using namespace std;  
#define int long long  
#define F first 
#define S second 
#define pb push_back 
const int N = 1e6, NN=26;
const int mod=1e9+7;
//int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); }
//int lcm(int a, int b) { return a / gcd(a, b) * b; }
//int binpow(int a,int b){if(!b)return 1; if(b&1)return a*binpow(a,b-1)%mod; int x=binpow(a,b/2); return x*x%mod;}
signed main(){   
    ios_base::sync_with_stdio(0);   
    cin.tie(0);   
    cout.tie(0);
    int t;
    cin >> t;
    while(t--){
        int n, k;
        cin >> n >> k;
        int a[n+1], sum=0;
        for(int i=1;i<=n;i++){ cin >> a[i]; sum+=a[i];}
        int g=0;
        bool b=0;
        while((1<<g)<=k){
            int d=(1<<g), sum=0;
            g++;
            for(int i=1;i<=n;i++){
                sum+=a[i]/d;
            }
            if(sum%2==1){b=1; break;}
        }
        if(b==0) cout << 0;
        else cout << 1;
    }
}

• Subtask 1: 26 / 26
• Subtask 2: 8 / 8
• Subtask 3: 11 / 11
• Subtask 4: 8 / 8
• Subtask 5: 16 / 16
• Subtask 6: 16 / 16
• Subtask 7: 7 / 7
• Subtask 8: 8 / 8