제출 #1145140

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1145140		dobri_oke	Football (info1cup20_football)	C++20	26 / 100	17 ms	584 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);
    srand(time(0));
    int t;
    cin >> t;
    while(t--){
        int n, k;
        cin >> n >> k;
        int a[n+1];
        int sum=0;
        for(int i=1;i<=n;i++){ 
            cin >> a[i];
            sum+=a[i];
        }
        if(k==1){
            if(sum%2==1) cout << 1;
            else cout << 0;
        }
        else{
            if(sum%2==1) cout << 1;
            else{
                cout << rand()%2;
            }
        }
    }
}

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