Submission #1145216

#	Time	Username	Problem	Language	Result	Execution time	Memory
1145216		arafatenok	Football (info1cup20_football)	C++17	26 / 100	15 ms	584 KiB

football

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma ("reroll")
#define skip continue;
#define gold ios_base::sync_with_stdio(false);cin.tie(NULL);
#define xa "\n"
#define int long long
#define all(a) a.begin(), a.end()
#define pb push_back
#define F first
#define S second
using namespace std;

const int mod = 1e9 + 7;
const int N = 2e5 + 7;
const int MAX = 1e9;
const int inf = 1e18;

int gcd(int a, int b) { if (b == 0) return a; else if(a == 0) return b; else return gcd(b, a % b); }
int lcm(int a, int b) { return a / gcd(a, b) * b; }

void solve() {
    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(sum % 2 == 1){
        cout << 1;
    }
    else cout << 0;
}

signed main() {
    gold;
    //freopen("sum2.in", "r", stdin);
    //freopen("sum2.out", "w", stdout);
    int t = 1;
    int ti = 1;
    cin >> t;
    while (t--) {
        //cout << "Case " << ti << ": ";
        solve();
        ti++;
    }
}

• 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