oj.uz

Submission #577425

# Submission time Handle Problem Language Result Execution time Memory
577425 2022-06-14T17:58:24 Z Noam527 Game (APIO22_game) C++17
60 / 100
 4000 ms 35516 KB 
#include <bits/stdc++.h>
#include "game.h"
const int OO = 0;
const int OOO = 0;
using namespace std;

int n, k;
vector<vector<int>> g, grev;
vector<int> s, e;
// s: maximum that reaches us
// e: minimum that we can reach
// e <= s, except for initial state

void init(int nn, int kk) {
	g.clear();
	grev.clear();
	s.clear();
	e.clear();

	n = nn;
	k = kk;
	g.resize(n);
	grev.resize(n);
	s.resize(n, -1);
	e.resize(n, n);

	for (int i = 0; i < k; i++) {
		s[i] = i;
		e[i] = i;
	}
}

void forward_bfs(int l, int m, int r, int v) {
	if (!(l <= e[v] && s[v] < m)) return;
	s[v] = m;
	queue<int> q;
	q.push(v);
	while (q.size()) {
		int x = q.front();
		q.pop();
		for (const auto &i : g[x]) {
			if (!(l <= e[i] && s[i] < m)) continue;
			s[i] = m;
			q.push(i);
		}
	}
}

void backward_bfs(int l, int m, int r, int v) {
	if (!(m < e[v] && s[v] <= r)) return;
	e[v] = m;
	queue<int> q;
	q.push(v);
	while (q.size()) {
		int x = q.front();
		q.pop();
		for (const auto &i : grev[x]) {
			if (!(m < e[i] && s[i] <= r)) continue;
			e[i] = m;
			q.push(i);
		}
	}
}

int add(int layer, int l, int r, int u, int v) {
	if (OO) {
		cout << "on layer " << layer << " " << l << " " << r << '\n';
	}
	if (l > r) return 0;
	int m = (l + r) / 2;
	if (s[u] >= e[v]) return 1;
	if (s[u] >= m)
		forward_bfs(l, m, r, v);
	if (e[v] <= m)
		backward_bfs(l, m, r, u);

	if ((m < s[u] && s[u] <= r) || (m < e[v] && e[v] <= r)) {
		if (add(layer + 1, m + 1, r, u, v)) return 1;
	}
	if ((l <= s[u] && s[u] < m) || (l <= e[v] && e[v] < m)) {
		if (add(layer + 1, l, m - 1, u, v)) return 1;
	}
	return 0;
}

void brute_dfs(vector<int> &vis, int v) {
	if (vis[v]) return;
	vis[v] = 1;
	for (const auto &i : g[v])
		brute_dfs(vis, i);
}

int brute() {
	vector<int> vis(n);
	for (int i = 0; i < k; i++) {
		for (auto &x : vis) x = 0;
		for (const auto &j : g[i])
			brute_dfs(vis, j);
		for (int j = 0; j <= i; j++)
			if (vis[j]) return 1;
	}
	return 0;
}

int add_teleporter(int u, int v) {
	if (OO) {
		cout << "current s: ";
		for (const auto &i : s) cout << i << " "; cout << '\n';
		cout << "current e: ";
		for (const auto &i : e) cout << i << " "; cout << '\n';
	}
	
	if (u < k && v < k) {
		return u >= v;
	}
	
	g[u].push_back(v);
	grev[v].push_back(u);
	int x = add(0, 0, k - 1, u, v);
	if (OOO) {
		int y = brute();
		if (x != y) {
			cout << "difference! " << x << " " << y << '\n';
			return 2;
		}
	}
	return x;
}

Compilation message

game.cpp: In function 'int add_teleporter(int, int)':
game.cpp:108:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  108 |   for (const auto &i : s) cout << i << " "; cout << '\n';
      |   ^~~
game.cpp:108:45: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  108 |   for (const auto &i : s) cout << i << " "; cout << '\n';
      |                                             ^~~~
game.cpp:110:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  110 |   for (const auto &i : e) cout << i << " "; cout << '\n';
      |   ^~~
game.cpp:110:45: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  110 |   for (const auto &i : e) cout << i << " "; cout << '\n';
      |                                             ^~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 0 ms 304 KB Output is correct
19 Correct 1 ms 208 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 0 ms 304 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 5 ms 400 KB Output is correct
25 Correct 5 ms 448 KB Output is correct
26 Correct 3 ms 336 KB Output is correct
27 Correct 3 ms 336 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 3 ms 336 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 0 ms 304 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 5 ms 400 KB Output is correct
25 Correct 5 ms 448 KB Output is correct
26 Correct 3 ms 336 KB Output is correct
27 Correct 3 ms 336 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 3 ms 336 KB Output is correct
30 Correct 16 ms 3036 KB Output is correct
31 Correct 5 ms 2248 KB Output is correct
32 Correct 19 ms 3752 KB Output is correct
33 Correct 17 ms 3744 KB Output is correct
34 Correct 1053 ms 4036 KB Output is correct
35 Correct 379 ms 3884 KB Output is correct
36 Correct 40 ms 3860 KB Output is correct
37 Correct 44 ms 3732 KB Output is correct
38 Correct 36 ms 3480 KB Output is correct
39 Correct 44 ms 3616 KB Output is correct
40 Correct 917 ms 4008 KB Output is correct
41 Correct 229 ms 3600 KB Output is correct
42 Correct 153 ms 3612 KB Output is correct
43 Correct 57 ms 3912 KB Output is correct
44 Correct 833 ms 3996 KB Output is correct

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 0 ms 304 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 5 ms 400 KB Output is correct
25 Correct 5 ms 448 KB Output is correct
26 Correct 3 ms 336 KB Output is correct
27 Correct 3 ms 336 KB Output is correct
28 Correct 2 ms 336 KB Output is correct
29 Correct 3 ms 336 KB Output is correct
30 Correct 16 ms 3036 KB Output is correct
31 Correct 5 ms 2248 KB Output is correct
32 Correct 19 ms 3752 KB Output is correct
33 Correct 17 ms 3744 KB Output is correct
34 Correct 1053 ms 4036 KB Output is correct
35 Correct 379 ms 3884 KB Output is correct
36 Correct 40 ms 3860 KB Output is correct
37 Correct 44 ms 3732 KB Output is correct
38 Correct 36 ms 3480 KB Output is correct
39 Correct 44 ms 3616 KB Output is correct
40 Correct 917 ms 4008 KB Output is correct
41 Correct 229 ms 3600 KB Output is correct
42 Correct 153 ms 3612 KB Output is correct
43 Correct 57 ms 3912 KB Output is correct
44 Correct 833 ms 3996 KB Output is correct
45 Correct 236 ms 28028 KB Output is correct
46 Correct 14 ms 17188 KB Output is correct
47 Correct 12 ms 17012 KB Output is correct
48 Correct 454 ms 35472 KB Output is correct
49 Correct 262 ms 35516 KB Output is correct
50 Execution timed out 4030 ms 26128 KB Time limit exceeded
51 Halted 0 ms 0 KB -