Submission #73893

#	Time	Username	Problem	Language	Result	Execution time	Memory
73893		Hoget157	Game (IOI14_game)	C++14	0 / 100	6 ms	588 KiB

game

#include "game.h"

int n,par[1500],rnk[1500],amari[1500];

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

int find(int x){
	if(x == par[x]) return x;
	return par[x] = find(par[x]);
}

void unite(int x,int y){
	x = find(x);
	y = find(y);
	int tmp = amari[x] + amari[y] - 2;
	if(rnk[x] < rnk[y]) par[x] = y;
	else{
		par[y] = x;
		if(rnk[x] == rnk[y]) rnk[x]++;
	}
	amari[find(x)] = tmp;
}

bool same(int x,int y){
	return find(x) == find(y);
}

int hasEdge(int u, int v) {
	u = find(u);
	v = find(v);
	if(u == v) return 1;
	if(amari[u] == 1 || amari[v] == 1){
		unite(u,v);
		return 1;
	}
	amari[u]--;
	amari[v]--;
	return 0;
}

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