제출 #935735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
935735		peterandvoi	게임 (IOI14_game)	C++17	15 / 100	1070 ms	604 KiB

game

#include <bits/stdc++.h>

using namespace std;

#ifdef ngu
#include "debug.h"
#else
#define debug(...) 42
#endif

struct my_dsu {
    int n, cc;
    vector<int> e, cant;
    vector<vector<int>> cnt;

    my_dsu() {};

    my_dsu(int n): n(n), cc(n) {
        e.resize(n);
        cant.resize(n, 0);
        cnt.resize(n, vector<int>(n, 0));
        for (int i = 0; i < n; ++i) {
            e[i] = -1;
            cant[i] = 1;
            for (int j = 0; j < n; ++j) {
                if (i != j) {
                    cnt[i][j]++;
                }
            }
        }
    }

    int get(int u) {
        return e[u] < 0 ? u : u = get(e[u]);
    }

    bool need_merge(int u) {
        return cant[u] == n - 1;
    }

    void del(int u, int v) {
        u = get(u);
        v = get(v);
        cnt[u][v]--;
        cnt[v][u]--;
        cant[u] += cnt[u][v] == 0;
        cant[v] += cnt[u][v] == 0;
    }

    void unite(int u, int v, bool big) {
        if (e[u] > e[v]) {
            swap(u, v);
        }
        cc--;
        e[u] += e[v];
        e[v] = u;
        cant[u] = 0;
        for (int j = 0; j < n; ++j) {
            if (get(j) != u && j == get(j)) {
                cnt[u][j] += cnt[v][j];
                cant[j] -= cnt[j][v] == 0;
                cant[j] -= cnt[j][u] == 0;
                cnt[j][u] += cnt[j][v];
                cnt[j][v] = 0;
                cant[j]++;
                cant[j] += cnt[j][u] == 0;
            } else {
                cnt[u][j] = 0;
            }
            cant[u] += cnt[u][j] == 0;
        }
        if (big && need_merge(u)) {
            for (int i = 0; i < n; ++i) {
                if (cnt[u][i]) {
                    unite(u, i, true);
                }
            }
        }
    }

    int check(int u, int v) {
        u = get(u);
        v = get(v);
        if (cnt[u][v] == 1) {
            unite(u, v, false);
            return 1;
        }
        del(u, v);
        return 0;
    }

    void upd(int u) {
        u = get(u);
        if (need_merge(u)) {
            int v = -1;
            for (int i = 0; i < n; ++i) {
                if (cnt[u][i]) {
                    v = i;
                    break;
                }
            }
            unite(u, v, true);
        }
    }

    bool same(int u, int v) {
        return get(u) == get(v);
    }
} G1, G2;


int hasEdge(int u, int v) {
    if (G1.same(u, v)) {
        return G2.check(u, v);
    }
    G1.del(u, v);
    G2.del(u, v);
    G1.upd(u);
    G1.upd(v);
    return 0;
}

void initialize(int n) {
    G1 = my_dsu(n);
    G2 = my_dsu(n);
}

#ifdef ngu
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    #ifdef ngu
    freopen("test.inp", "r", stdin);
    freopen("test.out", "w", stdout);
    #endif
    int n;
    cin >> n;
    initialize(n);
    for (int i = 0; i < n * (n - 1) / 2; ++i) {
        int u, v;
        cin >> u >> v;
        assert(G2.cc > 1);
        hasEdge(u, v);
//        debug(u, v, hasEdge(u, v));
    }
    debug(G1.cc);
    assert(G1.cc == 1);
}
#endif

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