oj.uz

Submission #107890

# Submission time Handle Problem Language Result Execution time Memory
107890 2019-04-26T07:32:11 Z tjd229 Cop and Robber (BOI14_coprobber) C++14
100 / 100
 935 ms 8696 KB 
#include "coprobber.h"
#include <queue>
using namespace std;
struct Tuple { int x, y, z; };
int mv[500][500];
int vis[500][500][2];
int d[500];
int opt[500][500];
int C;
int start(int N, bool A[MAX_N][MAX_N])
{
	queue<Tuple> q;
	for (int i = 0; i < N; ++i) {
		q.push({ i,i,0 }); q.push({ i,i,1 });
		vis[i][i][0] = 1; vis[i][i][1] = 1;
		for (int j = 0; j < N; ++j) d[i] += A[i][j];
	}
	while (q.size()) {
		Tuple t = q.front(); q.pop();
		C = t.x; int R = t.y; int z = t.z;
		if (z) {
			for (int i = 0; i < N; ++i) {//deg chk
				if (A[R][i] == 0) continue;
				if (vis[C][i][0]) continue;
				if (++opt[C][i]==d[i]) {
					vis[C][i][0] = 1;
					q.push({ C,i,0 });
				}
			}
		}
		else {
			for (int i = 0; i < N; ++i) {				
				if (i != C && A[C][i] == 0) continue;
				if (vis[i][R][1]) continue;
				vis[i][R][1] = 1;
				mv[i][R] = C;
				q.push({ i,R,1 });
			}
		}
	}
	for (C = 0; C < N; ++C) {
		bool flag = 1;
		for (int i = 0; i < N; ++i) 
			//if(i!=C)
				flag &= vis[C][i][1];//i==C?
		if (flag) return C;
	}
    return -1;
}
int nextMove(int R)
{
	C = mv[C][R];
    return C;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 329 ms 5624 KB Output is correct
5 Correct 49 ms 2936 KB Output is correct
6 Correct 391 ms 5928 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 338 ms 5580 KB Output is correct
4 Correct 333 ms 5880 KB Output is correct
5 Correct 332 ms 5568 KB Output is correct
6 Correct 339 ms 5624 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 4 ms 1152 KB Output is correct
11 Correct 5 ms 1152 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 1024 KB Output is correct
14 Correct 6 ms 1152 KB Output is correct
15 Correct 3 ms 896 KB Output is correct
16 Correct 4 ms 896 KB Output is correct
17 Correct 12 ms 1536 KB Output is correct
18 Correct 2 ms 1152 KB Output is correct
19 Correct 2 ms 384 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 329 ms 5724 KB Output is correct
5 Correct 50 ms 2936 KB Output is correct
6 Correct 394 ms 5900 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 338 ms 5736 KB Output is correct
10 Correct 330 ms 5672 KB Output is correct
11 Correct 335 ms 5544 KB Output is correct
12 Correct 345 ms 5628 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 3 ms 1152 KB Output is correct
18 Correct 4 ms 1152 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 3 ms 896 KB Output is correct
21 Correct 6 ms 1152 KB Output is correct
22 Correct 4 ms 896 KB Output is correct
23 Correct 3 ms 896 KB Output is correct
24 Correct 13 ms 1408 KB Output is correct
25 Correct 4 ms 1152 KB Output is correct
26 Correct 7 ms 2048 KB Output is correct
27 Correct 19 ms 3712 KB Output is correct
28 Correct 31 ms 4512 KB Output is correct
29 Correct 538 ms 8696 KB Output is correct
30 Correct 78 ms 5112 KB Output is correct
31 Correct 77 ms 5244 KB Output is correct
32 Correct 710 ms 7584 KB Output is correct
33 Correct 123 ms 4988 KB Output is correct
34 Correct 903 ms 8348 KB Output is correct
35 Correct 497 ms 6076 KB Output is correct
36 Correct 935 ms 7440 KB Output is correct
37 Correct 306 ms 4940 KB Output is correct
38 Correct 2 ms 384 KB Output is correct