Submission #430863

#	Time	Username	Problem	Language	Result	Execution time	Memory
430863		CSQ31	Game (IOI14_game)	C++17	100 / 100	462 ms	15404 KiB

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;
int par[1500];
int cnt[1500][1500];
int N;
int find(int x){
	if(x==par[x])return x;
	return par[x] = find(par[x]);
}
void initialize(int n){
	N=n;
	for(int i=0;i<n;i++)par[i] = i;
	for(int i=0;i<n;i++)
		for(int j=i+1;j<n;j++)
		    cnt[i][j] = 1;
			
}
int hasEdge(int u, int v){
	u = find(u);
	v = find(v);
	if(u>v)swap(u,v);
	if(cnt[u][v] == 1){
		par[u] = v;
		for(int i=0;i<N;i++){
			int a = find(i);
			if(i==u || i==v || a!=i)continue;
			cnt[min(v,a)][max(v,a)]+=cnt[min(u,a)][max(u,a)];
		}
		return 1;
	}else{
		cnt[u][v]--;
		return 0;
		
	}
	
}

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