Submission #1104673

#	Time	Username	Problem	Language	Result	Execution time	Memory
1104673		Nxmkxing	Game (IOI14_game)	C++14	0 / 100	1 ms	504 KiB

game

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

const int MxN = 1510;
int n, p[MxN], deg[MxN];

int find_set(int u) {
    if (p[u] == u) return u;
    return p[u] = find_set(p[u]);
}

void union_set(int u, int v) {
    u = find_set(u);
    v = find_set(v);
    if (u != v) {
        deg[u] += deg[v];
        p[v] = u;
    }
}

void initialize(int N) {
    n = N;
    for (int i = 0; i < n; i++) deg[i] = n - 1;
    iota(p, p + n, 0);
}

int hasEdge(int u, int v) {
    u = find_set(u);
    v = find_set(v);
    if (u == v) {
        deg[u] -= 2;
        return 0;
    }
    if (deg[u] == 1 || deg[v] == 1) {
        union_set(u, v);
        u = find_set(u);
        deg[u] -= 2;
        return 1;
    }
    else {
        deg[u]--;
        deg[v]--;
        return 0;
    }
}

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