oj.uz

Submission #780652

# Submission time Handle Problem Language Result Execution time Memory
780652 2023-07-12T11:26:18 Z rxlfd314 Cop and Robber (BOI14_coprobber) C++17
100 / 100
 473 ms 7088 KB 
#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;
using ari3 = array<int, 3>;

int nxt[500][500], cur = -1;

int start(int N, bool A[500][500]) {
	queue<ari3> qu;
	bool cw[N][N][2] = {};
	int deg[N][N] = {};
	for (int i = 0; i < N; i++) {
		cw[i][i][0] = true;
		qu.push({i, i, 0});
		for (int j = 0; j < N; j++) {
			for (int k = 0; k < N; k++) {
				deg[i][j] += A[j][k];
			}
		}
	}
	
	while (qu.size()) {
		auto [i, j, m] = qu.front();
		qu.pop();
		for (int k = 0; k < N; k++) {
			if (m && A[j][k]) {
				if (cw[i][k][0]) continue;
				if (!--deg[i][k]) {
					cw[i][k][0] = true;
					qu.push({i, k, 0});
				}
			} else if (!m && (A[i][k] || i == k)) {
				if (cw[k][j][1]) continue;
				cw[k][j][1] = true;
				qu.push({k, j, 1});
				nxt[k][j] = i;
			}
		}
	}
	
	for (int i = 0; i < N; i++) {
		bool can = true;
		for (int j = 0; j < N; j++) {
			can &= cw[i][j][1];
		}
		cur = can ? i : cur;
	}
	return cur;
} 

int nextMove(int r) {
	return cur = nxt[cur][r];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 228 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 317 ms 4096 KB Output is correct
5 Correct 40 ms 1712 KB Output is correct
6 Correct 347 ms 4376 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 316 ms 4076 KB Output is correct
4 Correct 325 ms 4100 KB Output is correct
5 Correct 289 ms 4004 KB Output is correct
6 Correct 338 ms 3964 KB Output is correct

Subtask #3
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 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 2 ms 592 KB Output is correct
11 Correct 3 ms 592 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 3 ms 592 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 2 ms 556 KB Output is correct
17 Correct 8 ms 868 KB Output is correct
18 Correct 2 ms 592 KB Output is correct
19 Correct 1 ms 208 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 228 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 317 ms 4096 KB Output is correct
5 Correct 40 ms 1712 KB Output is correct
6 Correct 347 ms 4376 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 316 ms 4076 KB Output is correct
10 Correct 325 ms 4100 KB Output is correct
11 Correct 289 ms 4004 KB Output is correct
12 Correct 338 ms 3964 KB Output is correct
13 Correct 0 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 208 KB Output is correct
19 Correct 0 ms 324 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 2 ms 592 KB Output is correct
23 Correct 3 ms 592 KB Output is correct
24 Correct 0 ms 336 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 3 ms 592 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 2 ms 556 KB Output is correct
29 Correct 8 ms 868 KB Output is correct
30 Correct 2 ms 592 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 336 ms 4132 KB Output is correct
36 Correct 40 ms 1756 KB Output is correct
37 Correct 343 ms 4340 KB Output is correct
38 Correct 0 ms 208 KB Output is correct
39 Correct 0 ms 336 KB Output is correct
40 Correct 304 ms 4084 KB Output is correct
41 Correct 329 ms 4104 KB Output is correct
42 Correct 285 ms 4000 KB Output is correct
43 Correct 337 ms 4076 KB Output is correct
44 Correct 0 ms 208 KB Output is correct
45 Correct 0 ms 208 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 336 KB Output is correct
48 Correct 2 ms 592 KB Output is correct
49 Correct 3 ms 592 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 464 KB Output is correct
52 Correct 3 ms 592 KB Output is correct
53 Correct 1 ms 464 KB Output is correct
54 Correct 1 ms 464 KB Output is correct
55 Correct 6 ms 848 KB Output is correct
56 Correct 2 ms 592 KB Output is correct
57 Correct 9 ms 976 KB Output is correct
58 Correct 32 ms 2192 KB Output is correct
59 Correct 67 ms 3020 KB Output is correct
60 Correct 375 ms 7088 KB Output is correct
61 Correct 107 ms 3552 KB Output is correct
62 Correct 100 ms 3908 KB Output is correct
63 Correct 409 ms 5832 KB Output is correct
64 Correct 99 ms 3660 KB Output is correct
65 Correct 456 ms 6920 KB Output is correct
66 Correct 295 ms 4580 KB Output is correct
67 Correct 473 ms 5808 KB Output is correct
68 Correct 240 ms 3372 KB Output is correct
69 Correct 0 ms 208 KB Output is correct