oj.uz

답안 #577417

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
577417 2022-06-14T17:43:36 Z Noam527 게임 (APIO22_game) C++17
60 / 100
 4000 ms 35488 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] <= r) || (m < e[v] <= r)) {
		if (add(layer + 1, m + 1, r, u, v)) return 1;
	}
	if ((l <= s[u] < m) || (l <= 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(int, int, int, int, int)':
game.cpp:77:9: warning: comparisons like 'X<=Y<=Z' do not have their mathematical meaning [-Wparentheses]
   77 |  if ((m < s[u] <= r) || (m < e[v] <= r)) {
game.cpp:77:28: warning: comparisons like 'X<=Y<=Z' do not have their mathematical meaning [-Wparentheses]
   77 |  if ((m < s[u] <= r) || (m < e[v] <= r)) {
game.cpp:80:9: warning: comparisons like 'X<=Y<=Z' do not have their mathematical meaning [-Wparentheses]
   80 |  if ((l <= s[u] < m) || (l <= e[v] < m)) {
game.cpp:80:28: warning: comparisons like 'X<=Y<=Z' do not have their mathematical meaning [-Wparentheses]
   80 |  if ((l <= s[u] < m) || (l <= e[v] < m)) {
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

# 결과 실행 시간 메모리 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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 208 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 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 0 ms 208 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 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 0 ms 208 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 356 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 360 KB Output is correct
24 Correct 8 ms 336 KB Output is correct
25 Correct 11 ms 424 KB Output is correct
26 Correct 9 ms 336 KB Output is correct
27 Correct 17 ms 420 KB Output is correct
28 Correct 11 ms 336 KB Output is correct
29 Correct 18 ms 400 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 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 0 ms 208 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 356 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 360 KB Output is correct
24 Correct 8 ms 336 KB Output is correct
25 Correct 11 ms 424 KB Output is correct
26 Correct 9 ms 336 KB Output is correct
27 Correct 17 ms 420 KB Output is correct
28 Correct 11 ms 336 KB Output is correct
29 Correct 18 ms 400 KB Output is correct
30 Correct 30 ms 3080 KB Output is correct
31 Correct 45 ms 2240 KB Output is correct
32 Correct 35 ms 3688 KB Output is correct
33 Correct 17 ms 3796 KB Output is correct
34 Correct 1213 ms 3896 KB Output is correct
35 Correct 672 ms 3892 KB Output is correct
36 Correct 75 ms 3780 KB Output is correct
37 Correct 273 ms 3812 KB Output is correct
38 Correct 310 ms 3596 KB Output is correct
39 Correct 329 ms 3648 KB Output is correct
40 Correct 1261 ms 4000 KB Output is correct
41 Correct 551 ms 3676 KB Output is correct
42 Correct 453 ms 3732 KB Output is correct
43 Correct 410 ms 3940 KB Output is correct
44 Correct 1109 ms 3912 KB Output is correct

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 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 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 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 0 ms 208 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 208 KB Output is correct
17 Correct 1 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 356 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 360 KB Output is correct
24 Correct 8 ms 336 KB Output is correct
25 Correct 11 ms 424 KB Output is correct
26 Correct 9 ms 336 KB Output is correct
27 Correct 17 ms 420 KB Output is correct
28 Correct 11 ms 336 KB Output is correct
29 Correct 18 ms 400 KB Output is correct
30 Correct 30 ms 3080 KB Output is correct
31 Correct 45 ms 2240 KB Output is correct
32 Correct 35 ms 3688 KB Output is correct
33 Correct 17 ms 3796 KB Output is correct
34 Correct 1213 ms 3896 KB Output is correct
35 Correct 672 ms 3892 KB Output is correct
36 Correct 75 ms 3780 KB Output is correct
37 Correct 273 ms 3812 KB Output is correct
38 Correct 310 ms 3596 KB Output is correct
39 Correct 329 ms 3648 KB Output is correct
40 Correct 1261 ms 4000 KB Output is correct
41 Correct 551 ms 3676 KB Output is correct
42 Correct 453 ms 3732 KB Output is correct
43 Correct 410 ms 3940 KB Output is correct
44 Correct 1109 ms 3912 KB Output is correct
45 Correct 459 ms 28032 KB Output is correct
46 Correct 49 ms 17096 KB Output is correct
47 Correct 77 ms 17112 KB Output is correct
48 Correct 642 ms 35488 KB Output is correct
49 Correct 444 ms 35400 KB Output is correct
50 Execution timed out 4075 ms 17368 KB Time limit exceeded
51 Halted 0 ms 0 KB -