Submission #957641

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
957641	2024-04-04T06:51:42 Z	pragmatist	Game (APIO22_game)	C++17	12 / 100	4000 ms	17596 KB

game

#include "game.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> g[30005];
bool is[1001][30005];

int n, k;

void init(int _n, int _k) {
	n = _n;
	k = _k;
	for(int i = 1; i < k; ++i) {
		g[i-1].push_back(i);
	}
	for(int i = 0; i < k; ++i) {	
		for(int j = i; j < k; ++j) {
			is[i][j]=1;
		}
	}
}

void dfs(int v, int root) {
	is[root][v] = 1;
	for(auto to : g[v]) {
		if(!is[root][to]) {
			dfs(to, root);
		}
	}
}

int add_teleporter(int u, int v) {
	if(v<=u && u<k) {
		return 1;
	}
	g[u].push_back(v);
	for(int i = 0; i < k; ++i) {
		for(int j = 0; j < n; ++j) {
			if(is[i][j]) {
				dfs(j, i);
			} 
		}
	}
	for(int i = 0; i < k; ++i) {
		for(int j = 0; j < n; ++j) {
			if(is[i][j]) {
				for(auto to : g[j]) {
					if(to == i) {
						return 1;
					}
				}
			}
		}
	}
	return 0;
}

Subtask #1

2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1112 KB	Output is correct
2	Correct	1 ms	3160 KB	Output is correct
3	Correct	15 ms	5208 KB	Output is correct
4	Correct	3 ms	3168 KB	Output is correct
5	Correct	13 ms	5208 KB	Output is correct
6	Correct	15 ms	5208 KB	Output is correct
7	Correct	14 ms	5208 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1112 KB	Output is correct
2	Correct	1 ms	3160 KB	Output is correct
3	Correct	15 ms	5208 KB	Output is correct
4	Correct	3 ms	3168 KB	Output is correct
5	Correct	13 ms	5208 KB	Output is correct
6	Correct	15 ms	5208 KB	Output is correct
7	Correct	14 ms	5208 KB	Output is correct
8	Correct	1 ms	1112 KB	Output is correct
9	Correct	1 ms	1112 KB	Output is correct
10	Correct	1 ms	1112 KB	Output is correct
11	Correct	1 ms	3180 KB	Output is correct
12	Correct	1 ms	3160 KB	Output is correct
13	Correct	1 ms	3160 KB	Output is correct
14	Correct	2 ms	3160 KB	Output is correct
15	Correct	3 ms	3160 KB	Output is correct
16	Correct	2 ms	3160 KB	Output is correct
17	Correct	7 ms	3160 KB	Output is correct
18	Correct	3 ms	3412 KB	Output is correct
19	Correct	5 ms	3160 KB	Output is correct

Subtask #3

0.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1112 KB	Output is correct
2	Correct	1 ms	3160 KB	Output is correct
3	Correct	15 ms	5208 KB	Output is correct
4	Correct	3 ms	3168 KB	Output is correct
5	Correct	13 ms	5208 KB	Output is correct
6	Correct	15 ms	5208 KB	Output is correct
7	Correct	14 ms	5208 KB	Output is correct
8	Correct	1 ms	1112 KB	Output is correct
9	Correct	1 ms	1112 KB	Output is correct
10	Correct	1 ms	1112 KB	Output is correct
11	Correct	1 ms	3180 KB	Output is correct
12	Correct	1 ms	3160 KB	Output is correct
13	Correct	1 ms	3160 KB	Output is correct
14	Correct	2 ms	3160 KB	Output is correct
15	Correct	3 ms	3160 KB	Output is correct
16	Correct	2 ms	3160 KB	Output is correct
17	Correct	7 ms	3160 KB	Output is correct
18	Correct	3 ms	3412 KB	Output is correct
19	Correct	5 ms	3160 KB	Output is correct
20	Correct	13 ms	3160 KB	Output is correct
21	Correct	19 ms	5208 KB	Output is correct
22	Correct	117 ms	5464 KB	Output is correct
23	Correct	13 ms	3160 KB	Output is correct
24	Correct	944 ms	17496 KB	Output is correct
25	Correct	3624 ms	9652 KB	Output is correct
26	Correct	2328 ms	5800 KB	Output is correct
27	Execution timed out	4043 ms	17596 KB	Time limit exceeded
28	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1112 KB	Output is correct
2	Correct	1 ms	3160 KB	Output is correct
3	Correct	15 ms	5208 KB	Output is correct
4	Correct	3 ms	3168 KB	Output is correct
5	Correct	13 ms	5208 KB	Output is correct
6	Correct	15 ms	5208 KB	Output is correct
7	Correct	14 ms	5208 KB	Output is correct
8	Correct	1 ms	1112 KB	Output is correct
9	Correct	1 ms	1112 KB	Output is correct
10	Correct	1 ms	1112 KB	Output is correct
11	Correct	1 ms	3180 KB	Output is correct
12	Correct	1 ms	3160 KB	Output is correct
13	Correct	1 ms	3160 KB	Output is correct
14	Correct	2 ms	3160 KB	Output is correct
15	Correct	3 ms	3160 KB	Output is correct
16	Correct	2 ms	3160 KB	Output is correct
17	Correct	7 ms	3160 KB	Output is correct
18	Correct	3 ms	3412 KB	Output is correct
19	Correct	5 ms	3160 KB	Output is correct
20	Correct	13 ms	3160 KB	Output is correct
21	Correct	19 ms	5208 KB	Output is correct
22	Correct	117 ms	5464 KB	Output is correct
23	Correct	13 ms	3160 KB	Output is correct
24	Correct	944 ms	17496 KB	Output is correct
25	Correct	3624 ms	9652 KB	Output is correct
26	Correct	2328 ms	5800 KB	Output is correct
27	Execution timed out	4043 ms	17596 KB	Time limit exceeded
28	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1112 KB	Output is correct
2	Correct	1 ms	3160 KB	Output is correct
3	Correct	15 ms	5208 KB	Output is correct
4	Correct	3 ms	3168 KB	Output is correct
5	Correct	13 ms	5208 KB	Output is correct
6	Correct	15 ms	5208 KB	Output is correct
7	Correct	14 ms	5208 KB	Output is correct
8	Correct	1 ms	1112 KB	Output is correct
9	Correct	1 ms	1112 KB	Output is correct
10	Correct	1 ms	1112 KB	Output is correct
11	Correct	1 ms	3180 KB	Output is correct
12	Correct	1 ms	3160 KB	Output is correct
13	Correct	1 ms	3160 KB	Output is correct
14	Correct	2 ms	3160 KB	Output is correct
15	Correct	3 ms	3160 KB	Output is correct
16	Correct	2 ms	3160 KB	Output is correct
17	Correct	7 ms	3160 KB	Output is correct
18	Correct	3 ms	3412 KB	Output is correct
19	Correct	5 ms	3160 KB	Output is correct
20	Correct	13 ms	3160 KB	Output is correct
21	Correct	19 ms	5208 KB	Output is correct
22	Correct	117 ms	5464 KB	Output is correct
23	Correct	13 ms	3160 KB	Output is correct
24	Correct	944 ms	17496 KB	Output is correct
25	Correct	3624 ms	9652 KB	Output is correct
26	Correct	2328 ms	5800 KB	Output is correct
27	Execution timed out	4043 ms	17596 KB	Time limit exceeded
28	Halted	0 ms	0 KB	-