oj.uz

Submission #544611

# Submission time Handle Problem Language Result Execution time Memory
544611 2022-04-02T13:35:16 Z rainboy Cop and Robber (BOI14_coprobber) C++
100 / 100
 693 ms 5696 KB 
#include <iostream>

using namespace std;

#define MAX_N	500

// modify the following functions
// you can define global variables and functions

int qu[MAX_N * MAX_N * 2], dd[MAX_N][MAX_N], nxt[MAX_N][MAX_N];
int i_;

int start(int N, bool A[MAX_N][MAX_N]) {
	int i, j, k;
	for (i = 0; i < N; i++)
		for (j = 0; j < N; j++)
			nxt[i][j] = -1;
	int head = 0, cnt = 0;
	for (j = 0; j < N; j++) {
		int d = 0;
		for (k = 0; k < N; k++)
			if (A[j][k])
				d++;
		for (i = 0; i < N; i++)
			if (i == j)
				qu[head + cnt++] = (i * N + j) * 2 + 1;
			else
				dd[i][j] = d;
	}
	while (cnt) {
		int ijt = qu[cnt--, head++], i = ijt / 2 / N, j = ijt / 2 % N, t = ijt % 2;
		if (t == 1) {
			for (k = 0; k < N; k++)
				if ((k == i || A[k][i]) && nxt[k][j] == -1)
					nxt[k][j] = i, qu[head + cnt++] = (k * N + j) * 2 + 0;
		} else {
			for (k = 0; k < N; k++)
				if (A[k][j] && --dd[i][k] == 0)
					qu[head + cnt++] = (i * N + k) * 2 + 1;
		}
	}
	return head == N * N * 2 ? 0 : -1;
}

int nextMove(int R) {
	return (i_ = nxt[i_][R]);
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 251 ms 5624 KB Output is correct
5 Correct 39 ms 2252 KB Output is correct
6 Correct 288 ms 5372 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 329 ms 5348 KB Output is correct
4 Correct 262 ms 5560 KB Output is correct
5 Correct 246 ms 5264 KB Output is correct
6 Correct 320 ms 5432 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 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 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 720 KB Output is correct
11 Correct 3 ms 720 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 592 KB Output is correct
14 Correct 3 ms 720 KB Output is correct
15 Correct 2 ms 592 KB Output is correct
16 Correct 2 ms 592 KB Output is correct
17 Correct 7 ms 976 KB Output is correct
18 Correct 1 ms 720 KB Output is correct
19 Correct 0 ms 336 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 251 ms 5624 KB Output is correct
5 Correct 39 ms 2252 KB Output is correct
6 Correct 288 ms 5372 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 329 ms 5348 KB Output is correct
10 Correct 262 ms 5560 KB Output is correct
11 Correct 246 ms 5264 KB Output is correct
12 Correct 320 ms 5432 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 ms 336 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 336 KB Output is correct
19 Correct 1 ms 336 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 720 KB Output is correct
23 Correct 3 ms 720 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 592 KB Output is correct
26 Correct 3 ms 720 KB Output is correct
27 Correct 2 ms 592 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 7 ms 976 KB Output is correct
30 Correct 1 ms 720 KB Output is correct
31 Correct 0 ms 336 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 312 ms 5696 KB Output is correct
36 Correct 34 ms 2204 KB Output is correct
37 Correct 280 ms 5432 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 0 ms 336 KB Output is correct
40 Correct 261 ms 5392 KB Output is correct
41 Correct 248 ms 5660 KB Output is correct
42 Correct 280 ms 5212 KB Output is correct
43 Correct 266 ms 5432 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 0 ms 336 KB Output is correct
46 Correct 0 ms 336 KB Output is correct
47 Correct 0 ms 336 KB Output is correct
48 Correct 1 ms 660 KB Output is correct
49 Correct 2 ms 720 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 2 ms 592 KB Output is correct
52 Correct 3 ms 720 KB Output is correct
53 Correct 1 ms 592 KB Output is correct
54 Correct 2 ms 592 KB Output is correct
55 Correct 7 ms 1024 KB Output is correct
56 Correct 1 ms 636 KB Output is correct
57 Correct 4 ms 1104 KB Output is correct
58 Correct 15 ms 1968 KB Output is correct
59 Correct 27 ms 2504 KB Output is correct
60 Correct 367 ms 5416 KB Output is correct
61 Correct 111 ms 2540 KB Output is correct
62 Correct 111 ms 2764 KB Output is correct
63 Correct 606 ms 5500 KB Output is correct
64 Correct 106 ms 2848 KB Output is correct
65 Correct 649 ms 5464 KB Output is correct
66 Correct 303 ms 5100 KB Output is correct
67 Correct 693 ms 5388 KB Output is correct
68 Correct 255 ms 3292 KB Output is correct
69 Correct 0 ms 336 KB Output is correct