Submission #118876

# Submission time Handle Problem Language Result Execution time Memory
118876 2019-06-20T00:22:16 Z andremfq Game (IOI14_game) C++17
42 / 100
1000 ms 15788 KB
#include<bits/stdc++.h>
#include "game.h"
using namespace std;
const int MAXN=1510;

set<int> s[MAXN];
int n,U,V,pai[MAXN],prof[MAXN],marc[MAXN][MAXN];

void initialize(int n)
{
	for(int i=0;i<n;i++)
	{
		pai[i]=i;
		marc[i][i]=1;
		prof[i]=1;
		for(int j=i+1;j<n;j++)
			s[i].insert(j),	s[j].insert(i);
	}	
}

void see()
{
	for(int i=0;i<n;i++)
	{
		set<int> :: iterator it;
		printf("U = %d : \n",i);
		for(it=s[i].begin();it!=s[i].end();it++)
			printf("%d ",*it);
		printf("\n\n");
	}
}

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;
	
	set<int> :: iterator it;
	
	if(prof[a]>prof[b])
	{	
		for(it=s[b].begin();it!=s[b].end();it++)	s[a].insert(*it);
		pai[b]=a;
		prof[a]+=prof[b];
		s[a].insert(b);	
		return;
	}
	
	for(it=s[a].begin();it!=s[a].end();it++)	s[b].insert(*it);
	s[b].insert(a);
	pai[a]=b;
	prof[b]+=prof[a];
}

int hasEdge(int u,int v)
{	
	set<int> :: iterator it;
	for(it=s[fd(u)].begin();it!=s[fd(u)].end();it++)
	{
		if(*it!=u && *it!=v && s[fd(v)].find(*it)!=s[fd(v)].end())
		{
//			printf("pai[%d] = %d   pai[%d] = %d\n",u,fd(u),v,fd(v));
//			see();
			s[fd(u)].erase(v), s[fd(v)].erase(u);
			return 0;
		}
	}
//	printf("pai[%d] = %d   pai[%d] = %d\n",u,fd(u),v,fd(v));
//	see();
	join(u,v);
	return 1;
}
/*
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",hasEdge(U,V));
	}
}

*/
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 356 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 356 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 556 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 640 KB Output is correct
26 Correct 2 ms 640 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 3 ms 640 KB Output is correct
29 Correct 3 ms 640 KB Output is correct
30 Correct 4 ms 512 KB Output is correct
31 Correct 3 ms 640 KB Output is correct
32 Correct 3 ms 640 KB Output is correct
33 Correct 3 ms 640 KB Output is correct
34 Correct 5 ms 1024 KB Output is correct
35 Correct 5 ms 1024 KB Output is correct
36 Correct 5 ms 1024 KB Output is correct
37 Correct 5 ms 1024 KB Output is correct
38 Correct 5 ms 1088 KB Output is correct
39 Correct 4 ms 1024 KB Output is correct
40 Correct 5 ms 1152 KB Output is correct
41 Correct 5 ms 1024 KB Output is correct
42 Correct 5 ms 1024 KB Output is correct
43 Correct 6 ms 1024 KB Output is correct
44 Correct 4 ms 1024 KB Output is correct
45 Correct 5 ms 1024 KB Output is correct
46 Correct 5 ms 1024 KB Output is correct
47 Correct 5 ms 1024 KB Output is correct
48 Correct 5 ms 1024 KB Output is correct
49 Correct 5 ms 1024 KB Output is correct
50 Correct 5 ms 1024 KB Output is correct
51 Correct 6 ms 1024 KB Output is correct
52 Correct 5 ms 1024 KB Output is correct
53 Correct 5 ms 1024 KB Output is correct
54 Correct 6 ms 1152 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 432 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 3 ms 640 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 2 ms 512 KB Output is correct
34 Correct 5 ms 1024 KB Output is correct
35 Correct 5 ms 1024 KB Output is correct
36 Correct 5 ms 1024 KB Output is correct
37 Correct 5 ms 1024 KB Output is correct
38 Correct 5 ms 1024 KB Output is correct
39 Correct 5 ms 1024 KB Output is correct
40 Correct 5 ms 1024 KB Output is correct
41 Correct 5 ms 1024 KB Output is correct
42 Correct 5 ms 1024 KB Output is correct
43 Correct 5 ms 1024 KB Output is correct
44 Correct 4 ms 1024 KB Output is correct
45 Correct 5 ms 1024 KB Output is correct
46 Correct 5 ms 1024 KB Output is correct
47 Correct 5 ms 1024 KB Output is correct
48 Correct 5 ms 1024 KB Output is correct
49 Correct 5 ms 1024 KB Output is correct
50 Correct 5 ms 1024 KB Output is correct
51 Correct 5 ms 1024 KB Output is correct
52 Correct 7 ms 1024 KB Output is correct
53 Correct 5 ms 1024 KB Output is correct
54 Correct 5 ms 1024 KB Output is correct
55 Correct 293 ms 15736 KB Output is correct
56 Correct 575 ms 15608 KB Output is correct
57 Correct 310 ms 15708 KB Output is correct
58 Correct 298 ms 15608 KB Output is correct
59 Correct 307 ms 15736 KB Output is correct
60 Correct 311 ms 15608 KB Output is correct
61 Correct 306 ms 15720 KB Output is correct
62 Correct 257 ms 15608 KB Output is correct
63 Correct 284 ms 15788 KB Output is correct
64 Execution timed out 1085 ms 15444 KB Time limit exceeded
65 Halted 0 ms 0 KB -