Submission #163136

#	Time	Username	Problem	Language	Result	Execution time	Memory
163136		keta_tsimakuridze	Game (IOI14_game)	C++14	100 / 100	545 ms	25336 KiB

game

#include<bits/stdc++.h>
using namespace std;
int a,b,n,size[1506],road[1506][1506],parent[1506];
void make_sets(){
	for(int k=0;k<n;k++)
	{
		parent[k]=k;
		size[k]=1;
		for(int i=0;i<n;i++)
		if(i!=k)
		road[i][k]=1,
		road[k][i]=1;
		
	}
}

int find_set(int u){
	if(u==parent[u]) return u;
	parent[u]=find_set(parent[u]);
	 return parent[u];
	 
}
int union_set(int m,int p ){
	int x=find_set(m);
       int y=find_set(p);
	if(road[x][y]>1){
		road[x][y]--;
		road[y][x]--; 
		return 0;
		
	}
	if(size[x]<size[y]) swap(x,y);
	parent[y]=x;
	size[x]+=size[y];
	for(int k=0;k<n;k++){
		if(parent[k]!=x)
		{
			road[k][x]+=road[k][y];
			
			road[x][k]=road[k][x];
		}
	} 
	return 1;
}
void initialize(int N){
	n=N;
	make_sets();
}
int hasEdge(int u, int v){
 int b=union_set(u,v);
	return b;
}

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