oj.uz

Submission #15982

# Submission time Handle Problem Language Result Execution time Memory
15982 2015-08-04T10:01:09 Z gs14004 Cop and Robber (BOI14_coprobber) C++14
100 / 100
 1070 ms 8124 KB 
#include "coprobber.h"
#include <cstdio>
#include <queue>
#include <algorithm>
#include <cstring>
using namespace std;
int indeg[500][500][2];

queue<int> qx, qy, qd;
bool vis[500][500][2];
int nxt[500][500];
int pos;

int start(int N, bool A[MAX_N][MAX_N])
{
	for (int i = 0; i < N; i++){
		for (int j = 0; j < N; j++){
			if (i == j) continue;
			indeg[i][j][1] = count(A[j], A[j] + N, 1);
			indeg[i][j][0] = 1;
		}
	}
	for (int i = 0; i < N; i++){
		for (int k = 0; k < 2; k++){
			qx.push(i);
			qy.push(i);
			qd.push(k);
			vis[i][i][k] = 1;
		}
	}
	while (!qx.empty()){
		int xf = qx.front();
		int yf = qy.front();
		int df = qd.front();
		qx.pop(), qy.pop(), qd.pop();
		if (df == 1){
			for (int i = 0; i < N; i++){
				if ((xf == i || A[xf][i]) && !vis[i][yf][0]){
					indeg[i][yf][0]--;
					if (indeg[i][yf][0] == 0){
						qx.push(i);
						qy.push(yf);
						qd.push(0);
						nxt[i][yf] = xf;
						vis[i][yf][0] = 1;
					}
				}
			}
		}
		else{
			for (int i = 0; i < N; i++){
				if (A[yf][i] &&!vis[xf][i][1]){
					indeg[xf][i][1]--;
					if (indeg[xf][i][1] == 0){
						qx.push(xf);
						qy.push(i);
						qd.push(1);
						vis[xf][i][1] = 1;
					}
				}
			}
		}
	}
	for (int i = 0; i < N; i++){
		int fnd = 0;
		for (int j = 0; j < N; j++){
			if (!vis[i][j][0]){
				fnd = 1;
				break;
			}
		}
		if (!fnd) return pos = i;
	}
	return -1;
}

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

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 740 ms 5188 KB Output is correct
5 Correct 88 ms 2596 KB Output is correct
6 Correct 748 ms 5528 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 384 KB Output is correct
3 Correct 681 ms 5276 KB Output is correct
4 Correct 703 ms 5156 KB Output is correct
5 Correct 652 ms 5112 KB Output is correct
6 Correct 693 ms 5144 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 2 ms 384 KB Output is correct
5 Correct 2 ms 384 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 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 5 ms 1024 KB Output is correct
11 Correct 6 ms 1152 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 4 ms 896 KB Output is correct
14 Correct 7 ms 1024 KB Output is correct
15 Correct 4 ms 768 KB Output is correct
16 Correct 4 ms 896 KB Output is correct
17 Correct 12 ms 1380 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 1 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 690 ms 5144 KB Output is correct
5 Correct 92 ms 2680 KB Output is correct
6 Correct 763 ms 5472 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 696 ms 5268 KB Output is correct
10 Correct 864 ms 5152 KB Output is correct
11 Correct 655 ms 5100 KB Output is correct
12 Correct 870 ms 5032 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 428 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 4 ms 1024 KB Output is correct
18 Correct 6 ms 1160 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 4 ms 896 KB Output is correct
21 Correct 7 ms 1024 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 4 ms 768 KB Output is correct
24 Correct 14 ms 1408 KB Output is correct
25 Correct 4 ms 1024 KB Output is correct
26 Correct 12 ms 1772 KB Output is correct
27 Correct 53 ms 3320 KB Output is correct
28 Correct 101 ms 4088 KB Output is correct
29 Correct 830 ms 8124 KB Output is correct
30 Correct 173 ms 4760 KB Output is correct
31 Correct 190 ms 4956 KB Output is correct
32 Correct 910 ms 7064 KB Output is correct
33 Correct 232 ms 4640 KB Output is correct
34 Correct 1070 ms 8016 KB Output is correct
35 Correct 692 ms 5768 KB Output is correct
36 Correct 1065 ms 6944 KB Output is correct
37 Correct 516 ms 4476 KB Output is correct
38 Correct 2 ms 384 KB Output is correct