Submission #1213792

#	Time	Username	Problem	Language	Result	Execution time	Memory
1213792		M_SH_O	Football (info1cup20_football)	C++20	26 / 100	110 ms	580 KiB

football

#include <bits/stdc++.h>
//#include "grader.h"
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define all(a) a.begin(), a.end()
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 5000000000000000000
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(1488);
ll randll(ll l, ll r){
    return uniform_int_distribution<ll>(l, r)(rng);
}

vector<map<ll, vll>> s;
vll p;

ll find(ll v) {
    if (p[v] == v) return v;
    return p[v] = find(p[v]);
}

void unite(ll a, ll b) {
    a = find(a);
    b = find(b);

    if (a == b) return;
    if (s[a].size() < s[b].size()) {
        p[a] = b;
        for (auto i : s[a]) {
            for (int j : i.se) {
                s[b][i.fr].pb(j);
            }
        }
        s[a].clear();
    }
    else {
        p[b] = a;
        for (auto i : s[b]) {
            for (int j : i.se) {
                s[a][i.fr].pb(j);
            }
        }
        s[b].clear();
    }
}

int main() {

    ll t;
    cin >> t;
    while (t --) {
        ll n, k;
        cin >> n >> k;
        vll a(n);
        ll x = 0;
        for (int i =0 ; i < n ; i++) {
            cin >> a[i];
            if (k == 1) {
                if (a[i] % 2 == 1) x ^= 1;
                continue;
            }
            if (a[i] % 2 == 1 || a[i]/2%2 == 1) x ^= 1;
        }
        cout << x;
    }
}

• 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