Submission #121664

#	Time	Username	Problem	Language	Result	Execution time	Memory
121664		andremfq	Game (IOI14_game)	C++17	100 / 100	488 ms	25336 KiB

game

#include<bits/stdc++.h>
#include "game.h"
using namespace std;
const int MAXN=1510;

int n,N,U,V,pai[MAXN],prof[MAXN],q[MAXN][MAXN];

void initialize(int n)
{
	N=n;
	for(int i=0;i<n;i++)
	{
		pai[i]=i;
		for(int j=0;j<n;j++)
			q[i][j]=1;
	}	
}

int fd(int v)
{
	if(v==pai[v])	return v;
	return pai[v]=fd(pai[v]);
}

void join(int a,int b)
{
	a=fd(a);	b=fd(b);
	if(a==b)	return;
	
	if(prof[a]>prof[b])		swap(a,b);
	
	for(int i=0;i<N;i++)	
		q[b][i]+=q[a][i],	q[i][b]+=q[i][a];
	
	pai[a]=b;
	
	if(prof[a]==prof[b])	prof[b]++;
}

int hasEdge(int u,int v)
{	
	int U=fd(u),	V=fd(v);
	if(q[U][V]==1)
	{
//		printf("pai[%d] = %d  pai[%d] = %d\n",u,U,v,V);
//		printf("q = %d   q = %d\n",q[U][V],q[V][U]);
		join(u,v);
		return 1;
	}
	q[U][V]--;	q[V][U]--;
//	printf("q = %d   q = %d\n",q[U][V],q[V][U]);
	return 0;
}
/*
int main ()
{
	scanf("%d",&n);
	
	initialize(n);
	
	for(int i=0;i<n*(n-1)/2;i++)
	{
		scanf("%d %d",&U,&V);
		
		printf("%d\n\n",hasEdge(U,V));
	}
}
*/

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