Submission #1095483

#	Time	Username	Problem	Language	Result	Execution time	Memory
1095483		HaciyevAlik	Game (IOI14_game)	C++14	0 / 100	1 ms	348 KiB

game

#include <bits/stdc++.h>
#include "game.h"
using namespace std;

const int mx = 105;
int cnt[mx];
int n;

struct DSU {
    vector<int> par;
    int comp;
    DSU(int N) {
        comp = N;
        par.assign(N, -1);
    }
    int Find(int u) {
        if(par[u] < 0) return u;
        else return par[u] = Find(par[u]);
    }
    bool uni(int u,int v) {
        u = Find(u);
        v = Find(v);
        if(u != v) {
            if(par[u] > par[v]) {
                swap(u,v);
            }
            par[u] += par[v];
            par[v] = u;
            --comp;
            return true;
        } else {
            return false;
        }
    }
};

DSU dsu(4);

void initialize(int N) {
    n = N;
}


int hasEdge(int u, int v) {
    cnt[u]++, cnt[v]++;
    if(cnt[u] == n - 1 || cnt[v] == n - 1) {
        return 1;
    }
    return !dsu.uni(u,v);
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 27
• Subtask 3: 0 / 58