Submission #234684

#	Time	Username	Problem	Language	Result	Execution time	Memory
234684		Fischer	Game (IOI14_game)	C++14	0 / 100	5 ms	384 KiB

game

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1510 + 10;
int rnk[maxn];
int link[maxn];
int cnt[maxn][maxn];
int n;

int get(int x) {
	if (x == link[x]) {
		return x;
	}
	return link[x] = get(link[x]);
}

void initialize(int n) {
	::n = n;
	for (int i = 1; i <= n; ++i) {
		link[i] = i;
		rnk[i] = 1;
	}
}

int hasEdge(int u, int v) {
	u = get(u); v = get(v);
	if (u == v) return 1;
	cnt[u][v] = cnt[v][u] += 1;
	if (cnt[u][v] < rnk[u] * rnk[v]) return 0;
    if (rnk[u] < rnk[v]) swap(u, v);
    rnk[u] += rnk[v];
    link[v] = u;
    for (int i = 1; i <= n; ++i) {
    	cnt[i][u] = cnt[u][i] = cnt[i][u] + cnt[i][v];
    }
    return 1;
}

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