Submission #56511

#	Time	Username	Problem	Language	Result	Execution time	Memory
56511		aome	Game (IOI14_game)	C++17	100 / 100	768 ms	160328 KiB

game

#include "game.h"

#include <bits/stdc++.h>

using namespace std;

const int N = 1505;

int n;
int par[N];
int cnt[N][N];

int find(int u) { return u == par[u] ? u : par[u] = find(par[u]); }

void initialize(int _n) {
	n = _n;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < i; ++j) {
			cnt[i][j] = cnt[j][i] = 1;
		}
	}
	for (int i = 0; i < n; ++i) par[i] = i;
}

int hasEdge(int u, int v) {
    u = find(u), v = find(v);
    if (u == v || cnt[u][v] > 1) {
    	cnt[u][v]--, cnt[v][u]--;
    	return 0;
    }
    cnt[u][v] = cnt[v][u] = 0; 
    for (int i = 0; i < n; ++i) {
    	cnt[v][i] += cnt[u][i], cnt[u][i] = 0;
    	cnt[i][v] += cnt[i][u], cnt[i][u] = 0;
    }
    par[u] = v; return 1;
}

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