Submission #366786

#	Time	Username	Problem	Language	Result	Execution time	Memory
366786		KoD	Game (IOI14_game)	C++17	0 / 100	1 ms	364 KiB

game

#include <bits/stdc++.h>

struct DSU {
    std::vector<int> par;
    DSU() { }
    DSU(const int n): par(n, -1) { }
    int find(const int u) {
        return par[u] < 0 ? u : par[u] = find(par[u]);
    }
    bool merge(int u, int v) {
        u = find(u);
        v = find(v);
        if (u == v) {
            return false;
        }
        if (par[u] > par[v]) {
            std::swap(u, v);
        }
        par[u] += par[v];
        par[v] = u;
        return true;
    }
};

DSU dsu;
int N;
int count[2000][2000];

void initialize(int n) {
    N = n;
    dsu = DSU(n);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (i != j) {
                count[i][j] = 1;
            }
        }
    }
}

int hasEdge(int u, int v) {
    u = dsu.find(u);
    v = dsu.find(v);
    if (count[u][v] == 1) {
        for (int i = 0; i < N; ++i) {
            count[u][i] += count[v][i];
            count[i][u] += count[v][i];
        }
        dsu.merge(u, v);
        return 1;
    }
    else {
        count[u][v] -= 1;
        count[v][u] -= 1;
        return 0;
    }
}

#ifdef __APPLE__
int main() {
    int n;
    std::cin >> n;
    initialize(n);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            int u, v;
            std::cin >> u >> v;
            std::cout << hasEdge(u, v) << '\n';
        }
    }
}
#endif

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