답안 #725335

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
725335	2023-04-17T09:50:11 Z	SanguineChameleon	게임 (APIO22_game)	C++17	2 / 100	13 ms	14388 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 = sqrt(k);
	for (int i = 0; i < k; i++) {
		max_in[i] = i - 1;
		min_out[i] = i;
	}
	for (int i = k; i < n; i++) {
		max_in[i] = -1;
		min_out[i] = k;
	}
}

void update_in(int u, int val) {
	if (done) {
		return;
	}
	if (val <= max_in[u]) {
		return;
	}
	bool update = ((max_in[u] / block) < (val / block) || (max_in[u] / block) == (min_out[u] / block));
	max_in[u] = val;
	if (max_in[u] >= min_out[u]) {
		done = true;
		return;
	}
	if (update) {
		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;
	}
	bool update = ((min_out[u] / block) > (val / block) || (max_in[u] / block) == (min_out[u] / block));
	min_out[u] = val;
	if (max_in[u] >= min_out[u]) {
		done = true;
		return;
	}
	if (update) {
		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)));
	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	8 ms	14288 KB	Output is correct
2	Correct	8 ms	14288 KB	Output is correct
3	Correct	9 ms	14288 KB	Output is correct
4	Correct	10 ms	14288 KB	Output is correct
5	Correct	11 ms	14288 KB	Output is correct
6	Correct	10 ms	14288 KB	Output is correct
7	Correct	13 ms	14292 KB	Output is correct

Subtask #2

0.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	14288 KB	Output is correct
2	Correct	8 ms	14288 KB	Output is correct
3	Correct	9 ms	14288 KB	Output is correct
4	Correct	10 ms	14288 KB	Output is correct
5	Correct	11 ms	14288 KB	Output is correct
6	Correct	10 ms	14288 KB	Output is correct
7	Correct	13 ms	14292 KB	Output is correct
8	Correct	9 ms	14288 KB	Output is correct
9	Correct	9 ms	14336 KB	Output is correct
10	Correct	10 ms	14288 KB	Output is correct
11	Correct	11 ms	14288 KB	Output is correct
12	Correct	9 ms	14344 KB	Output is correct
13	Correct	9 ms	14328 KB	Output is correct
14	Correct	10 ms	14388 KB	Output is correct
15	Correct	9 ms	14288 KB	Output is correct
16	Correct	10 ms	14288 KB	Output is correct
17	Correct	11 ms	14280 KB	Output is correct
18	Incorrect	10 ms	14288 KB	Wrong Answer[1]
19	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	14288 KB	Output is correct
2	Correct	8 ms	14288 KB	Output is correct
3	Correct	9 ms	14288 KB	Output is correct
4	Correct	10 ms	14288 KB	Output is correct
5	Correct	11 ms	14288 KB	Output is correct
6	Correct	10 ms	14288 KB	Output is correct
7	Correct	13 ms	14292 KB	Output is correct
8	Correct	9 ms	14288 KB	Output is correct
9	Correct	9 ms	14336 KB	Output is correct
10	Correct	10 ms	14288 KB	Output is correct
11	Correct	11 ms	14288 KB	Output is correct
12	Correct	9 ms	14344 KB	Output is correct
13	Correct	9 ms	14328 KB	Output is correct
14	Correct	10 ms	14388 KB	Output is correct
15	Correct	9 ms	14288 KB	Output is correct
16	Correct	10 ms	14288 KB	Output is correct
17	Correct	11 ms	14280 KB	Output is correct
18	Incorrect	10 ms	14288 KB	Wrong Answer[1]
19	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	14288 KB	Output is correct
2	Correct	8 ms	14288 KB	Output is correct
3	Correct	9 ms	14288 KB	Output is correct
4	Correct	10 ms	14288 KB	Output is correct
5	Correct	11 ms	14288 KB	Output is correct
6	Correct	10 ms	14288 KB	Output is correct
7	Correct	13 ms	14292 KB	Output is correct
8	Correct	9 ms	14288 KB	Output is correct
9	Correct	9 ms	14336 KB	Output is correct
10	Correct	10 ms	14288 KB	Output is correct
11	Correct	11 ms	14288 KB	Output is correct
12	Correct	9 ms	14344 KB	Output is correct
13	Correct	9 ms	14328 KB	Output is correct
14	Correct	10 ms	14388 KB	Output is correct
15	Correct	9 ms	14288 KB	Output is correct
16	Correct	10 ms	14288 KB	Output is correct
17	Correct	11 ms	14280 KB	Output is correct
18	Incorrect	10 ms	14288 KB	Wrong Answer[1]
19	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	14288 KB	Output is correct
2	Correct	8 ms	14288 KB	Output is correct
3	Correct	9 ms	14288 KB	Output is correct
4	Correct	10 ms	14288 KB	Output is correct
5	Correct	11 ms	14288 KB	Output is correct
6	Correct	10 ms	14288 KB	Output is correct
7	Correct	13 ms	14292 KB	Output is correct
8	Correct	9 ms	14288 KB	Output is correct
9	Correct	9 ms	14336 KB	Output is correct
10	Correct	10 ms	14288 KB	Output is correct
11	Correct	11 ms	14288 KB	Output is correct
12	Correct	9 ms	14344 KB	Output is correct
13	Correct	9 ms	14328 KB	Output is correct
14	Correct	10 ms	14388 KB	Output is correct
15	Correct	9 ms	14288 KB	Output is correct
16	Correct	10 ms	14288 KB	Output is correct
17	Correct	11 ms	14280 KB	Output is correct
18	Incorrect	10 ms	14288 KB	Wrong Answer[1]
19	Halted	0 ms	0 KB	-