제출 #1145214

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1145214		tnt	Football (info1cup20_football)	C++20	100 / 100	111 ms	580 KiB

football

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#define pb push_back                    
#define ll long long
#define int long long
//#define sort(all(v)) sort(v.begin(),v.end())

int mod = 998244353;
const int N = 5000 + 10;
const int inf = 1e9;
int fact[200001];
ll binpow(ll a, ll b){
 if(b == 0) return 1;
 else if(b % 2 == 1) return (a * binpow(a, b - 1)) % mod;
 ll p = binpow(a,b / 2);
 return (p * p) % mod;
}
int a[N][N];
signed main(){
    //freopen("mootube.in", "r", stdin);
    //freopen("mootube.out", "w", stdout);
    int t;
    cin >> t;
    while(t--){
        int n,k;
        cin >> n >> k;
        int sum = 0;
        int a[n + 1];
        for(int i = 1; i <= n; i++){
            cin >> a[i];
            sum += a[i];
        }
        if(sum % 2 == 1){
            cout << 1;
        }
        else{
            int p = 2;
            sum =0;
            bool f = 0;
            while(p <= k){
                for(int i = 1; i <= n; i++){
                    sum += a[i] / p;
                }
                if(sum % 2 == 1){
                    f = 1;
                    break;
                }
                p *= 2;
                sum = 0;
            }
            cout << f;
        }
    }
}

• 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