Submission #48350

#	Time	Username	Problem	Language	Result	Execution time	Memory
48350		jeong	Game (IOI14_game)	C++17	100 / 100	473 ms	16188 KiB

game

#include <stdio.h>
#define N (1500)
int p[N], e[N][N], nn;
void initialize(int n){
	nn=n;
	for(int i=0;i<n;i++){
		p[i]=i;
		for(int j=0;j<n;j++)e[i][j]=i!=j;
	}
}
int find(int x){if(p[x] == x)return x;return p[x] = find(p[x]);}
int hasEdge(int u, int v){
	int a = find(u), b = find(v);
	if(e[a][b]==1){
		p[b]=a;
		for(int i=0; i<nn; i++)e[a][i]=e[i][a]+=e[b][i];
		return 1;
	}
	e[a][b]=--e[b][a];
	return 0;
}

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