답안 #725355

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
725355	2023-04-17T10:39:26 Z	SanguineChameleon	게임 (APIO22_game)	C++17	60 / 100	4000 ms	39420 KB

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;
 
const int maxN = 3e5 + 20;
int block;
int max_in[maxN];
int min_out[maxN];
vector<int> adj1[maxN];
vector<int> adj2[maxN];
bool done = false;
int n, k;
 
void init(int _n, int _k) {
	n = _n;
	k = _k;
	block = 1;
	for (int i = 0; i < k; i++) {
		max_in[i] = (i - 1) / block;
		min_out[i] = i / block;
	}
	for (int i = k; i < n; i++) {
		max_in[i] = -1 / block;
		min_out[i] = k / block;
	}
}
 
void update_in(int u, int val) {
	if (done) {
		return;
	}
	if (val <= max_in[u]) {
		return;
	}
	max_in[u] = val;
	if (max_in[u] >= min_out[u]) {
		done = true;
		return;
	}
	for (auto v: adj1[u]) {
		update_in(v, val);
	}
}
 
void update_out(int u, int val) {
	if (done) {
		return;
	}
	if (val >= min_out[u]) {
		return;
	}
	min_out[u] = val;
	if (max_in[u] >= min_out[u]) {
		done = true;
		return;
	}
	for (auto v: adj2[u]) {
		update_out(v, val);
	}
}
 
int add_teleporter(int u, int v) {
	update_in(v, max(max_in[u], (u < k ? u : -1) / block));
	update_out(u, min_out[v]);
	adj1[u].push_back(v);
	adj2[v].push_back(u);
	return done;
}

Subtask #1

2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	14340 KB	Output is correct
2	Correct	7 ms	14288 KB	Output is correct
3	Correct	8 ms	14304 KB	Output is correct
4	Correct	9 ms	14392 KB	Output is correct
5	Correct	9 ms	14288 KB	Output is correct
6	Correct	8 ms	14288 KB	Output is correct
7	Correct	8 ms	14288 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	14340 KB	Output is correct
2	Correct	7 ms	14288 KB	Output is correct
3	Correct	8 ms	14304 KB	Output is correct
4	Correct	9 ms	14392 KB	Output is correct
5	Correct	9 ms	14288 KB	Output is correct
6	Correct	8 ms	14288 KB	Output is correct
7	Correct	8 ms	14288 KB	Output is correct
8	Correct	7 ms	14288 KB	Output is correct
9	Correct	8 ms	14348 KB	Output is correct
10	Correct	8 ms	14384 KB	Output is correct
11	Correct	8 ms	14284 KB	Output is correct
12	Correct	7 ms	14288 KB	Output is correct
13	Correct	8 ms	14336 KB	Output is correct
14	Correct	8 ms	14312 KB	Output is correct
15	Correct	8 ms	14288 KB	Output is correct
16	Correct	10 ms	14288 KB	Output is correct
17	Correct	7 ms	14288 KB	Output is correct
18	Correct	8 ms	14288 KB	Output is correct
19	Correct	8 ms	14288 KB	Output is correct

Subtask #3

18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	14340 KB	Output is correct
2	Correct	7 ms	14288 KB	Output is correct
3	Correct	8 ms	14304 KB	Output is correct
4	Correct	9 ms	14392 KB	Output is correct
5	Correct	9 ms	14288 KB	Output is correct
6	Correct	8 ms	14288 KB	Output is correct
7	Correct	8 ms	14288 KB	Output is correct
8	Correct	7 ms	14288 KB	Output is correct
9	Correct	8 ms	14348 KB	Output is correct
10	Correct	8 ms	14384 KB	Output is correct
11	Correct	8 ms	14284 KB	Output is correct
12	Correct	7 ms	14288 KB	Output is correct
13	Correct	8 ms	14336 KB	Output is correct
14	Correct	8 ms	14312 KB	Output is correct
15	Correct	8 ms	14288 KB	Output is correct
16	Correct	10 ms	14288 KB	Output is correct
17	Correct	7 ms	14288 KB	Output is correct
18	Correct	8 ms	14288 KB	Output is correct
19	Correct	8 ms	14288 KB	Output is correct
20	Correct	8 ms	14412 KB	Output is correct
21	Correct	9 ms	14300 KB	Output is correct
22	Correct	8 ms	14416 KB	Output is correct
23	Correct	7 ms	14364 KB	Output is correct
24	Correct	13 ms	14420 KB	Output is correct
25	Correct	10 ms	14416 KB	Output is correct
26	Correct	12 ms	14416 KB	Output is correct
27	Correct	10 ms	14416 KB	Output is correct
28	Correct	8 ms	14420 KB	Output is correct
29	Correct	9 ms	14416 KB	Output is correct

Subtask #4

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	14340 KB	Output is correct
2	Correct	7 ms	14288 KB	Output is correct
3	Correct	8 ms	14304 KB	Output is correct
4	Correct	9 ms	14392 KB	Output is correct
5	Correct	9 ms	14288 KB	Output is correct
6	Correct	8 ms	14288 KB	Output is correct
7	Correct	8 ms	14288 KB	Output is correct
8	Correct	7 ms	14288 KB	Output is correct
9	Correct	8 ms	14348 KB	Output is correct
10	Correct	8 ms	14384 KB	Output is correct
11	Correct	8 ms	14284 KB	Output is correct
12	Correct	7 ms	14288 KB	Output is correct
13	Correct	8 ms	14336 KB	Output is correct
14	Correct	8 ms	14312 KB	Output is correct
15	Correct	8 ms	14288 KB	Output is correct
16	Correct	10 ms	14288 KB	Output is correct
17	Correct	7 ms	14288 KB	Output is correct
18	Correct	8 ms	14288 KB	Output is correct
19	Correct	8 ms	14288 KB	Output is correct
20	Correct	8 ms	14412 KB	Output is correct
21	Correct	9 ms	14300 KB	Output is correct
22	Correct	8 ms	14416 KB	Output is correct
23	Correct	7 ms	14364 KB	Output is correct
24	Correct	13 ms	14420 KB	Output is correct
25	Correct	10 ms	14416 KB	Output is correct
26	Correct	12 ms	14416 KB	Output is correct
27	Correct	10 ms	14416 KB	Output is correct
28	Correct	8 ms	14420 KB	Output is correct
29	Correct	9 ms	14416 KB	Output is correct
30	Correct	24 ms	15692 KB	Output is correct
31	Correct	11 ms	15012 KB	Output is correct
32	Correct	34 ms	16600 KB	Output is correct
33	Correct	36 ms	16460 KB	Output is correct
34	Correct	1300 ms	17528 KB	Output is correct
35	Correct	356 ms	16852 KB	Output is correct
36	Correct	45 ms	16560 KB	Output is correct
37	Correct	55 ms	16408 KB	Output is correct
38	Correct	49 ms	16224 KB	Output is correct
39	Correct	36 ms	16180 KB	Output is correct
40	Correct	845 ms	17584 KB	Output is correct
41	Correct	186 ms	16536 KB	Output is correct
42	Correct	129 ms	16328 KB	Output is correct
43	Correct	57 ms	17156 KB	Output is correct
44	Correct	876 ms	17460 KB	Output is correct

Subtask #5

0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	10 ms	14340 KB	Output is correct
2	Correct	7 ms	14288 KB	Output is correct
3	Correct	8 ms	14304 KB	Output is correct
4	Correct	9 ms	14392 KB	Output is correct
5	Correct	9 ms	14288 KB	Output is correct
6	Correct	8 ms	14288 KB	Output is correct
7	Correct	8 ms	14288 KB	Output is correct
8	Correct	7 ms	14288 KB	Output is correct
9	Correct	8 ms	14348 KB	Output is correct
10	Correct	8 ms	14384 KB	Output is correct
11	Correct	8 ms	14284 KB	Output is correct
12	Correct	7 ms	14288 KB	Output is correct
13	Correct	8 ms	14336 KB	Output is correct
14	Correct	8 ms	14312 KB	Output is correct
15	Correct	8 ms	14288 KB	Output is correct
16	Correct	10 ms	14288 KB	Output is correct
17	Correct	7 ms	14288 KB	Output is correct
18	Correct	8 ms	14288 KB	Output is correct
19	Correct	8 ms	14288 KB	Output is correct
20	Correct	8 ms	14412 KB	Output is correct
21	Correct	9 ms	14300 KB	Output is correct
22	Correct	8 ms	14416 KB	Output is correct
23	Correct	7 ms	14364 KB	Output is correct
24	Correct	13 ms	14420 KB	Output is correct
25	Correct	10 ms	14416 KB	Output is correct
26	Correct	12 ms	14416 KB	Output is correct
27	Correct	10 ms	14416 KB	Output is correct
28	Correct	8 ms	14420 KB	Output is correct
29	Correct	9 ms	14416 KB	Output is correct
30	Correct	24 ms	15692 KB	Output is correct
31	Correct	11 ms	15012 KB	Output is correct
32	Correct	34 ms	16600 KB	Output is correct
33	Correct	36 ms	16460 KB	Output is correct
34	Correct	1300 ms	17528 KB	Output is correct
35	Correct	356 ms	16852 KB	Output is correct
36	Correct	45 ms	16560 KB	Output is correct
37	Correct	55 ms	16408 KB	Output is correct
38	Correct	49 ms	16224 KB	Output is correct
39	Correct	36 ms	16180 KB	Output is correct
40	Correct	845 ms	17584 KB	Output is correct
41	Correct	186 ms	16536 KB	Output is correct
42	Correct	129 ms	16328 KB	Output is correct
43	Correct	57 ms	17156 KB	Output is correct
44	Correct	876 ms	17460 KB	Output is correct
45	Correct	280 ms	28068 KB	Output is correct
46	Correct	14 ms	17056 KB	Output is correct
47	Correct	17 ms	17072 KB	Output is correct
48	Correct	333 ms	39420 KB	Output is correct
49	Correct	305 ms	35608 KB	Output is correct
50	Execution timed out	4040 ms	30772 KB	Time limit exceeded
51	Halted	0 ms	0 KB	-