oj.uz

Submission #725412

# Submission time Handle Problem Language Result Execution time Memory
725412 2023-04-17T11:31:48 Z SanguineChameleon Game (APIO22_game) C++17
60 / 100
 4000 ms 45608 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")

#include "game.h"
#include <bits/stdc++.h>
using namespace std;

const int shift = 9;
const int maxN = 3e5 + 20;
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;
	for (int i = 0; i < k; i++) {
		max_in[i] = i;
		min_out[i] = i + 1;
	}
	for (int i = k; i < n; i++) {
		max_in[i] = 0;
		min_out[i] = k + 1;
	}
}

void update_in(int u, int val);

void update_out(int u, int val);

void update_in(int u, int val) {
	if (done) {
		return;
	}
	bool diff = (max_in[u] >> shift) != (val >> shift);
	bool same = (max_in[u] >> shift) == (min_out[u] >> shift);
	max_in[u] = val;
	if (max_in[u] >= min_out[u]) {
		done = true;
		return;
	}
	if (diff) {
		for (auto v: adj1[u]) {
			if (max_in[u] > max_in[v]) {
				update_in(v, max_in[u]);
			}
		}
	}
	else if (same) {
		for (auto v: adj1[u]) {
			if (max_in[u] > max_in[v]) {
				update_in(v, max_in[u]);
			}
		}
		for (auto v: adj2[u]) {
			if (min_out[u] < min_out[v]) {
				update_out(v, min_out[u]);
			}
		}
	}
}
 
void update_out(int u, int val) {
	if (done) {
		return;
	}
	bool diff = (min_out[u] >> shift) != (val >> shift);
	bool same = (max_in[u] >> shift) == (min_out[u] >> shift);
	min_out[u] = val;
	if (max_in[u] >= min_out[u]) {
		done = true;
		return;
	}
	if (diff) {
		for (auto v: adj2[u]) {
			if (min_out[u] < min_out[v]) {
				update_out(v, min_out[u]);
			}
		}
	}
	else if (same) {
		for (auto v: adj1[u]) {
			if (max_in[u] > max_in[v]) {
				update_in(v, max_in[u]);
			}
		}
		for (auto v: adj2[u]) {
			if (min_out[u] < min_out[v]) {
				update_out(v, min_out[u]);
			}
		}
	}
}
 
int add_teleporter(int u, int v) {
	int val = max(max_in[u], (u < k ? u + 1 : 0));
	if (val > max_in[v]) {
		update_in(v, val);
	}
	if (min_out[v] < min_out[u]) {
		update_out(u, min_out[v]);
	}
	adj1[u].push_back(v);
	adj2[v].push_back(u);
	return done;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14288 KB Output is correct
2 Correct 10 ms 14344 KB Output is correct
3 Correct 9 ms 14288 KB Output is correct
4 Correct 9 ms 14316 KB Output is correct
5 Correct 12 ms 14352 KB Output is correct
6 Correct 10 ms 14404 KB Output is correct
7 Correct 8 ms 14336 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14288 KB Output is correct
2 Correct 10 ms 14344 KB Output is correct
3 Correct 9 ms 14288 KB Output is correct
4 Correct 9 ms 14316 KB Output is correct
5 Correct 12 ms 14352 KB Output is correct
6 Correct 10 ms 14404 KB Output is correct
7 Correct 8 ms 14336 KB Output is correct
8 Correct 8 ms 14288 KB Output is correct
9 Correct 9 ms 14288 KB Output is correct
10 Correct 10 ms 14300 KB Output is correct
11 Correct 9 ms 14288 KB Output is correct
12 Correct 8 ms 14288 KB Output is correct
13 Correct 8 ms 14288 KB Output is correct
14 Correct 8 ms 14288 KB Output is correct
15 Correct 8 ms 14336 KB Output is correct
16 Correct 8 ms 14288 KB Output is correct
17 Correct 10 ms 14404 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

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14288 KB Output is correct
2 Correct 10 ms 14344 KB Output is correct
3 Correct 9 ms 14288 KB Output is correct
4 Correct 9 ms 14316 KB Output is correct
5 Correct 12 ms 14352 KB Output is correct
6 Correct 10 ms 14404 KB Output is correct
7 Correct 8 ms 14336 KB Output is correct
8 Correct 8 ms 14288 KB Output is correct
9 Correct 9 ms 14288 KB Output is correct
10 Correct 10 ms 14300 KB Output is correct
11 Correct 9 ms 14288 KB Output is correct
12 Correct 8 ms 14288 KB Output is correct
13 Correct 8 ms 14288 KB Output is correct
14 Correct 8 ms 14288 KB Output is correct
15 Correct 8 ms 14336 KB Output is correct
16 Correct 8 ms 14288 KB Output is correct
17 Correct 10 ms 14404 KB Output is correct
18 Correct 8 ms 14288 KB Output is correct
19 Correct 8 ms 14288 KB Output is correct
20 Correct 9 ms 14412 KB Output is correct
21 Correct 8 ms 14412 KB Output is correct
22 Correct 10 ms 14388 KB Output is correct
23 Correct 9 ms 14416 KB Output is correct
24 Correct 14 ms 14416 KB Output is correct
25 Correct 13 ms 14420 KB Output is correct
26 Correct 11 ms 14416 KB Output is correct
27 Correct 10 ms 14416 KB Output is correct
28 Correct 10 ms 14416 KB Output is correct
29 Correct 11 ms 14476 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14288 KB Output is correct
2 Correct 10 ms 14344 KB Output is correct
3 Correct 9 ms 14288 KB Output is correct
4 Correct 9 ms 14316 KB Output is correct
5 Correct 12 ms 14352 KB Output is correct
6 Correct 10 ms 14404 KB Output is correct
7 Correct 8 ms 14336 KB Output is correct
8 Correct 8 ms 14288 KB Output is correct
9 Correct 9 ms 14288 KB Output is correct
10 Correct 10 ms 14300 KB Output is correct
11 Correct 9 ms 14288 KB Output is correct
12 Correct 8 ms 14288 KB Output is correct
13 Correct 8 ms 14288 KB Output is correct
14 Correct 8 ms 14288 KB Output is correct
15 Correct 8 ms 14336 KB Output is correct
16 Correct 8 ms 14288 KB Output is correct
17 Correct 10 ms 14404 KB Output is correct
18 Correct 8 ms 14288 KB Output is correct
19 Correct 8 ms 14288 KB Output is correct
20 Correct 9 ms 14412 KB Output is correct
21 Correct 8 ms 14412 KB Output is correct
22 Correct 10 ms 14388 KB Output is correct
23 Correct 9 ms 14416 KB Output is correct
24 Correct 14 ms 14416 KB Output is correct
25 Correct 13 ms 14420 KB Output is correct
26 Correct 11 ms 14416 KB Output is correct
27 Correct 10 ms 14416 KB Output is correct
28 Correct 10 ms 14416 KB Output is correct
29 Correct 11 ms 14476 KB Output is correct
30 Correct 25 ms 15712 KB Output is correct
31 Correct 14 ms 14968 KB Output is correct
32 Correct 33 ms 16808 KB Output is correct
33 Correct 34 ms 16508 KB Output is correct
34 Correct 54 ms 18668 KB Output is correct
35 Correct 53 ms 17288 KB Output is correct
36 Correct 45 ms 16496 KB Output is correct
37 Correct 50 ms 16456 KB Output is correct
38 Correct 38 ms 16200 KB Output is correct
39 Correct 55 ms 16188 KB Output is correct
40 Correct 78 ms 18688 KB Output is correct
41 Correct 65 ms 17380 KB Output is correct
42 Correct 45 ms 16920 KB Output is correct
43 Correct 57 ms 17712 KB Output is correct
44 Correct 222 ms 17968 KB Output is correct

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14288 KB Output is correct
2 Correct 10 ms 14344 KB Output is correct
3 Correct 9 ms 14288 KB Output is correct
4 Correct 9 ms 14316 KB Output is correct
5 Correct 12 ms 14352 KB Output is correct
6 Correct 10 ms 14404 KB Output is correct
7 Correct 8 ms 14336 KB Output is correct
8 Correct 8 ms 14288 KB Output is correct
9 Correct 9 ms 14288 KB Output is correct
10 Correct 10 ms 14300 KB Output is correct
11 Correct 9 ms 14288 KB Output is correct
12 Correct 8 ms 14288 KB Output is correct
13 Correct 8 ms 14288 KB Output is correct
14 Correct 8 ms 14288 KB Output is correct
15 Correct 8 ms 14336 KB Output is correct
16 Correct 8 ms 14288 KB Output is correct
17 Correct 10 ms 14404 KB Output is correct
18 Correct 8 ms 14288 KB Output is correct
19 Correct 8 ms 14288 KB Output is correct
20 Correct 9 ms 14412 KB Output is correct
21 Correct 8 ms 14412 KB Output is correct
22 Correct 10 ms 14388 KB Output is correct
23 Correct 9 ms 14416 KB Output is correct
24 Correct 14 ms 14416 KB Output is correct
25 Correct 13 ms 14420 KB Output is correct
26 Correct 11 ms 14416 KB Output is correct
27 Correct 10 ms 14416 KB Output is correct
28 Correct 10 ms 14416 KB Output is correct
29 Correct 11 ms 14476 KB Output is correct
30 Correct 25 ms 15712 KB Output is correct
31 Correct 14 ms 14968 KB Output is correct
32 Correct 33 ms 16808 KB Output is correct
33 Correct 34 ms 16508 KB Output is correct
34 Correct 54 ms 18668 KB Output is correct
35 Correct 53 ms 17288 KB Output is correct
36 Correct 45 ms 16496 KB Output is correct
37 Correct 50 ms 16456 KB Output is correct
38 Correct 38 ms 16200 KB Output is correct
39 Correct 55 ms 16188 KB Output is correct
40 Correct 78 ms 18688 KB Output is correct
41 Correct 65 ms 17380 KB Output is correct
42 Correct 45 ms 16920 KB Output is correct
43 Correct 57 ms 17712 KB Output is correct
44 Correct 222 ms 17968 KB Output is correct
45 Correct 235 ms 28076 KB Output is correct
46 Correct 15 ms 17104 KB Output is correct
47 Correct 15 ms 17036 KB Output is correct
48 Correct 350 ms 45608 KB Output is correct
49 Correct 272 ms 35420 KB Output is correct
50 Execution timed out 4066 ms 40376 KB Time limit exceeded
51 Halted 0 ms 0 KB -