Submission #64881

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
64881	2018-08-06T03:17:18 Z	MatheusLealV	Game (IOI14_game)	C++17	15 / 100	10 ms	1096 KB

game

#include <bits/stdc++.h>
#define maxn 1550
using namespace std;
typedef long long ll;

int block[maxn], n, ligacoes, faltam;

int hasEdge(int u, int v)
{
	if(block[u] == n - 2 || block[v] == n - 2 || ligacoes >= faltam)
	{
		ligacoes --;

		faltam --;

		return 1;
	}

	block[u] ++, block[v] ++;

	faltam --;

	return 0;
}

void initialize(int N_)
{
	n = N_;

	faltam = n*(n - 1)/2;

	ligacoes = n - 1;

	memset(block, 0, sizeof block);

}

Subtask #1

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	3 ms	544 KB	Output is correct
5	Correct	4 ms	552 KB	Output is correct
6	Correct	3 ms	552 KB	Output is correct
7	Correct	3 ms	556 KB	Output is correct
8	Correct	3 ms	736 KB	Output is correct
9	Correct	3 ms	736 KB	Output is correct
10	Correct	2 ms	736 KB	Output is correct
11	Correct	2 ms	784 KB	Output is correct
12	Correct	2 ms	784 KB	Output is correct
13	Correct	4 ms	800 KB	Output is correct
14	Correct	3 ms	800 KB	Output is correct
15	Correct	10 ms	800 KB	Output is correct
16	Correct	2 ms	800 KB	Output is correct
17	Correct	3 ms	800 KB	Output is correct
18	Correct	4 ms	800 KB	Output is correct
19	Correct	3 ms	800 KB	Output is correct
20	Correct	3 ms	800 KB	Output is correct
21	Correct	2 ms	800 KB	Output is correct
22	Correct	3 ms	800 KB	Output is correct
23	Correct	3 ms	800 KB	Output is correct
24	Correct	2 ms	892 KB	Output is correct

Subtask #2

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	892 KB	Output is correct
2	Correct	2 ms	892 KB	Output is correct
3	Correct	3 ms	892 KB	Output is correct
4	Correct	4 ms	892 KB	Output is correct
5	Correct	2 ms	892 KB	Output is correct
6	Correct	4 ms	892 KB	Output is correct
7	Correct	3 ms	892 KB	Output is correct
8	Correct	3 ms	892 KB	Output is correct
9	Correct	3 ms	892 KB	Output is correct
10	Correct	2 ms	892 KB	Output is correct
11	Correct	3 ms	892 KB	Output is correct
12	Correct	3 ms	956 KB	Output is correct
13	Correct	3 ms	980 KB	Output is correct
14	Correct	3 ms	980 KB	Output is correct
15	Correct	3 ms	980 KB	Output is correct
16	Correct	3 ms	980 KB	Output is correct
17	Correct	3 ms	980 KB	Output is correct
18	Correct	2 ms	980 KB	Output is correct
19	Correct	2 ms	980 KB	Output is correct
20	Correct	3 ms	980 KB	Output is correct
21	Correct	3 ms	980 KB	Output is correct
22	Correct	2 ms	980 KB	Output is correct
23	Correct	2 ms	980 KB	Output is correct
24	Correct	3 ms	980 KB	Output is correct
25	Incorrect	2 ms	980 KB	Output isn't correct
26	Halted	0 ms	0 KB	-

Subtask #3

0 / 58.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	980 KB	Output is correct
2	Correct	2 ms	980 KB	Output is correct
3	Correct	4 ms	980 KB	Output is correct
4	Correct	3 ms	980 KB	Output is correct
5	Correct	3 ms	980 KB	Output is correct
6	Correct	2 ms	980 KB	Output is correct
7	Correct	2 ms	980 KB	Output is correct
8	Correct	4 ms	980 KB	Output is correct
9	Correct	2 ms	980 KB	Output is correct
10	Correct	3 ms	980 KB	Output is correct
11	Correct	3 ms	980 KB	Output is correct
12	Correct	2 ms	980 KB	Output is correct
13	Correct	3 ms	980 KB	Output is correct
14	Correct	3 ms	980 KB	Output is correct
15	Correct	3 ms	980 KB	Output is correct
16	Correct	3 ms	1092 KB	Output is correct
17	Correct	2 ms	1096 KB	Output is correct
18	Correct	3 ms	1096 KB	Output is correct
19	Correct	4 ms	1096 KB	Output is correct
20	Correct	3 ms	1096 KB	Output is correct
21	Correct	4 ms	1096 KB	Output is correct
22	Correct	2 ms	1096 KB	Output is correct
23	Correct	3 ms	1096 KB	Output is correct
24	Correct	2 ms	1096 KB	Output is correct
25	Incorrect	4 ms	1096 KB	Output isn't correct
26	Halted	0 ms	0 KB	-