Submission #48326

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
48326	2018-05-11T17:22:57 Z	jeong	Game (IOI14_game)	C++17	15 / 100	3 ms	1444 KB

game

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

Subtask #1

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	560 KB	Output is correct
4	Correct	2 ms	560 KB	Output is correct
5	Correct	2 ms	560 KB	Output is correct
6	Correct	2 ms	560 KB	Output is correct
7	Correct	2 ms	560 KB	Output is correct
8	Correct	2 ms	560 KB	Output is correct
9	Correct	2 ms	560 KB	Output is correct
10	Correct	2 ms	560 KB	Output is correct
11	Correct	2 ms	560 KB	Output is correct
12	Correct	2 ms	560 KB	Output is correct
13	Correct	2 ms	560 KB	Output is correct
14	Correct	2 ms	560 KB	Output is correct
15	Correct	2 ms	560 KB	Output is correct
16	Correct	2 ms	560 KB	Output is correct
17	Correct	2 ms	560 KB	Output is correct
18	Correct	2 ms	560 KB	Output is correct
19	Correct	2 ms	612 KB	Output is correct
20	Correct	1 ms	708 KB	Output is correct
21	Correct	1 ms	708 KB	Output is correct
22	Correct	2 ms	708 KB	Output is correct
23	Correct	1 ms	708 KB	Output is correct
24	Correct	2 ms	708 KB	Output is correct

Subtask #2

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	708 KB	Output is correct
2	Correct	2 ms	748 KB	Output is correct
3	Correct	2 ms	748 KB	Output is correct
4	Correct	2 ms	748 KB	Output is correct
5	Correct	2 ms	748 KB	Output is correct
6	Correct	2 ms	748 KB	Output is correct
7	Correct	2 ms	748 KB	Output is correct
8	Correct	2 ms	748 KB	Output is correct
9	Correct	2 ms	748 KB	Output is correct
10	Correct	2 ms	748 KB	Output is correct
11	Correct	2 ms	748 KB	Output is correct
12	Correct	2 ms	748 KB	Output is correct
13	Correct	2 ms	748 KB	Output is correct
14	Correct	2 ms	748 KB	Output is correct
15	Correct	2 ms	748 KB	Output is correct
16	Correct	2 ms	748 KB	Output is correct
17	Correct	2 ms	748 KB	Output is correct
18	Correct	2 ms	748 KB	Output is correct
19	Correct	2 ms	748 KB	Output is correct
20	Correct	2 ms	748 KB	Output is correct
21	Correct	2 ms	748 KB	Output is correct
22	Correct	2 ms	748 KB	Output is correct
23	Correct	2 ms	748 KB	Output is correct
24	Correct	2 ms	748 KB	Output is correct
25	Correct	2 ms	892 KB	Output is correct
26	Correct	2 ms	892 KB	Output is correct
27	Correct	2 ms	892 KB	Output is correct
28	Correct	2 ms	892 KB	Output is correct
29	Correct	2 ms	892 KB	Output is correct
30	Correct	2 ms	892 KB	Output is correct
31	Correct	2 ms	892 KB	Output is correct
32	Correct	2 ms	892 KB	Output is correct
33	Correct	2 ms	892 KB	Output is correct
34	Correct	3 ms	1276 KB	Output is correct
35	Correct	3 ms	1276 KB	Output is correct
36	Correct	3 ms	1332 KB	Output is correct
37	Correct	3 ms	1348 KB	Output is correct
38	Correct	3 ms	1348 KB	Output is correct
39	Correct	3 ms	1348 KB	Output is correct
40	Correct	3 ms	1348 KB	Output is correct
41	Correct	3 ms	1384 KB	Output is correct
42	Incorrect	3 ms	1444 KB	Output isn't correct
43	Halted	0 ms	0 KB	-

Subtask #3

0 / 58.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1444 KB	Output is correct
2	Correct	2 ms	1444 KB	Output is correct
3	Correct	2 ms	1444 KB	Output is correct
4	Correct	2 ms	1444 KB	Output is correct
5	Correct	2 ms	1444 KB	Output is correct
6	Correct	2 ms	1444 KB	Output is correct
7	Correct	2 ms	1444 KB	Output is correct
8	Correct	2 ms	1444 KB	Output is correct
9	Correct	2 ms	1444 KB	Output is correct
10	Correct	2 ms	1444 KB	Output is correct
11	Correct	2 ms	1444 KB	Output is correct
12	Correct	2 ms	1444 KB	Output is correct
13	Correct	2 ms	1444 KB	Output is correct
14	Correct	2 ms	1444 KB	Output is correct
15	Correct	2 ms	1444 KB	Output is correct
16	Correct	2 ms	1444 KB	Output is correct
17	Correct	2 ms	1444 KB	Output is correct
18	Correct	2 ms	1444 KB	Output is correct
19	Correct	2 ms	1444 KB	Output is correct
20	Correct	2 ms	1444 KB	Output is correct
21	Correct	2 ms	1444 KB	Output is correct
22	Correct	2 ms	1444 KB	Output is correct
23	Correct	1 ms	1444 KB	Output is correct
24	Correct	2 ms	1444 KB	Output is correct
25	Correct	2 ms	1444 KB	Output is correct
26	Correct	2 ms	1444 KB	Output is correct
27	Correct	2 ms	1444 KB	Output is correct
28	Correct	2 ms	1444 KB	Output is correct
29	Correct	2 ms	1444 KB	Output is correct
30	Correct	2 ms	1444 KB	Output is correct
31	Correct	2 ms	1444 KB	Output is correct
32	Correct	2 ms	1444 KB	Output is correct
33	Correct	2 ms	1444 KB	Output is correct
34	Correct	3 ms	1444 KB	Output is correct
35	Correct	3 ms	1444 KB	Output is correct
36	Correct	3 ms	1444 KB	Output is correct
37	Correct	3 ms	1444 KB	Output is correct
38	Correct	3 ms	1444 KB	Output is correct
39	Correct	3 ms	1444 KB	Output is correct
40	Correct	3 ms	1444 KB	Output is correct
41	Correct	3 ms	1444 KB	Output is correct
42	Incorrect	3 ms	1444 KB	Output isn't correct
43	Halted	0 ms	0 KB	-