Submission #118697

# Submission time Handle Problem Language Result Execution time Memory
118697 2019-06-19T11:51:40 Z onjo0127 Cop and Robber (BOI14_coprobber) C++11
100 / 100
761 ms 10888 KB
#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;
using tiii = tuple<int, int, int>;

int now, n, D[MAX_N][MAX_N][2], deg[MAX_N][MAX_N][2], W[MAX_N][MAX_N];
bool adj[MAX_N][MAX_N], vs[MAX_N][MAX_N];

int start(int N, bool A[MAX_N][MAX_N]) {
	n = N;
	memset(W, -1, sizeof(W));
	for(int i=0; i<n; i++) for(int j=0; j<n; j++) D[i][j][0] = D[i][j][1] = 1;
	for(int i=0; i<n; i++) for(int j=0; j<n; j++) adj[i][j] = A[i][j], deg[0][i][0] += A[i][j], deg[i][j][1] = 1;
	for(int i=1; i<n; i++) for(int j=0; j<n; j++) deg[i][j][0] = deg[0][j][0];
	for(int i=0; i<n; i++) deg[i][i][0] = deg[i][i][1] = 0;
	queue<tiii> que;
	for(int i=0; i<n; i++) { que.push((tiii){i, i, 0}); que.push((tiii){i, i, 1}); }
	while(que.size()) {
		int c, r, t; tie(c, r, t) = que.front(); que.pop();
		D[c][r][t] = 0;
		if(t == 0) {
			for(int i=0; i<n; i++) {
				if(adj[r][i] && --deg[c][i][0] == 0) que.push((tiii){c, i, 1});
			}
		}
		else {
			for(int i=0; i<n; i++) {
				if((adj[c][i] || i == c) && --deg[i][r][1] == 0) {
					que.push((tiii){i, r, 0});
					W[i][r] = c;
				}
			}
		}
	}
	for(int i=0; i<n; i++) {
		bool fl = 1;
		for(int j=0; j<n; j++) if(D[i][j][0] == 1) fl = 0;
		if(fl) return now = i;
	}
	return -1;
}

bool chk(int v, int R) {
	for(int i=0; i<n; i++) if(adj[R][i] && vs[v][i]) return 0;
	return 1;
}

int nextMove(int R) {
	return now = W[now][R];

	vs[now][R] = 1;
	if(D[now][R][1] == 0 && chk(now, R)) return now;
	for(int i=0; i<n; i++) {
		if(adj[now][i] && D[i][R][1] == 0 && chk(i, R)) return now = i;
	}
	return -1;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1408 KB Output is correct
2 Correct 3 ms 1408 KB Output is correct
3 Correct 3 ms 1408 KB Output is correct
4 Correct 277 ms 7160 KB Output is correct
5 Correct 43 ms 4224 KB Output is correct
6 Correct 317 ms 8576 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1408 KB Output is correct
2 Correct 2 ms 1408 KB Output is correct
3 Correct 278 ms 8304 KB Output is correct
4 Correct 279 ms 8272 KB Output is correct
5 Correct 273 ms 8076 KB Output is correct
6 Correct 299 ms 8192 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 1280 KB Output is correct
2 Correct 3 ms 1408 KB Output is correct
3 Correct 3 ms 1408 KB Output is correct
4 Correct 2 ms 1408 KB Output is correct
5 Correct 2 ms 1408 KB Output is correct
6 Correct 3 ms 1408 KB Output is correct
7 Correct 3 ms 1408 KB Output is correct
8 Correct 3 ms 1408 KB Output is correct
9 Correct 3 ms 1536 KB Output is correct
10 Correct 4 ms 2176 KB Output is correct
11 Correct 6 ms 2304 KB Output is correct
12 Correct 3 ms 1536 KB Output is correct
13 Correct 4 ms 2048 KB Output is correct
14 Correct 5 ms 2176 KB Output is correct
15 Correct 4 ms 1920 KB Output is correct
16 Correct 4 ms 1920 KB Output is correct
17 Correct 10 ms 2560 KB Output is correct
18 Correct 4 ms 2176 KB Output is correct
19 Correct 3 ms 1408 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1408 KB Output is correct
2 Correct 3 ms 1408 KB Output is correct
3 Correct 3 ms 1408 KB Output is correct
4 Correct 277 ms 7160 KB Output is correct
5 Correct 43 ms 4224 KB Output is correct
6 Correct 317 ms 8576 KB Output is correct
7 Correct 3 ms 1408 KB Output is correct
8 Correct 2 ms 1408 KB Output is correct
9 Correct 278 ms 8304 KB Output is correct
10 Correct 279 ms 8272 KB Output is correct
11 Correct 273 ms 8076 KB Output is correct
12 Correct 299 ms 8192 KB Output is correct
13 Correct 2 ms 1280 KB Output is correct
14 Correct 3 ms 1408 KB Output is correct
15 Correct 3 ms 1408 KB Output is correct
16 Correct 2 ms 1408 KB Output is correct
17 Correct 2 ms 1408 KB Output is correct
18 Correct 3 ms 1408 KB Output is correct
19 Correct 3 ms 1408 KB Output is correct
20 Correct 3 ms 1408 KB Output is correct
21 Correct 3 ms 1536 KB Output is correct
22 Correct 4 ms 2176 KB Output is correct
23 Correct 6 ms 2304 KB Output is correct
24 Correct 3 ms 1536 KB Output is correct
25 Correct 4 ms 2048 KB Output is correct
26 Correct 5 ms 2176 KB Output is correct
27 Correct 4 ms 1920 KB Output is correct
28 Correct 4 ms 1920 KB Output is correct
29 Correct 10 ms 2560 KB Output is correct
30 Correct 4 ms 2176 KB Output is correct
31 Correct 3 ms 1408 KB Output is correct
32 Correct 2 ms 1280 KB Output is correct
33 Correct 3 ms 1408 KB Output is correct
34 Correct 3 ms 1408 KB Output is correct
35 Correct 281 ms 8284 KB Output is correct
36 Correct 43 ms 4216 KB Output is correct
37 Correct 332 ms 8504 KB Output is correct
38 Correct 2 ms 1408 KB Output is correct
39 Correct 3 ms 1408 KB Output is correct
40 Correct 276 ms 8184 KB Output is correct
41 Correct 278 ms 8312 KB Output is correct
42 Correct 271 ms 8184 KB Output is correct
43 Correct 289 ms 8056 KB Output is correct
44 Correct 3 ms 1408 KB Output is correct
45 Correct 3 ms 1408 KB Output is correct
46 Correct 3 ms 1408 KB Output is correct
47 Correct 3 ms 1536 KB Output is correct
48 Correct 4 ms 2176 KB Output is correct
49 Correct 6 ms 2304 KB Output is correct
50 Correct 3 ms 1664 KB Output is correct
51 Correct 4 ms 2048 KB Output is correct
52 Correct 6 ms 2176 KB Output is correct
53 Correct 4 ms 1920 KB Output is correct
54 Correct 4 ms 1920 KB Output is correct
55 Correct 11 ms 2560 KB Output is correct
56 Correct 4 ms 2176 KB Output is correct
57 Correct 7 ms 3072 KB Output is correct
58 Correct 21 ms 5120 KB Output is correct
59 Correct 29 ms 6140 KB Output is correct
60 Correct 421 ms 10888 KB Output is correct
61 Correct 180 ms 6648 KB Output is correct
62 Correct 142 ms 7032 KB Output is correct
63 Correct 560 ms 9892 KB Output is correct
64 Correct 231 ms 6776 KB Output is correct
65 Correct 739 ms 10796 KB Output is correct
66 Correct 352 ms 8404 KB Output is correct
67 Correct 761 ms 9616 KB Output is correct
68 Correct 266 ms 6692 KB Output is correct
69 Correct 3 ms 1408 KB Output is correct