oj.uz

Submission #5956

# Submission time Handle Problem Language Result Execution time Memory
5956 2014-06-06T10:09:17 Z model_code Cop and Robber (BOI14_coprobber) C++
100 / 100
 607 ms 7640 KB 
#include "coprobber.h"
#include <algorithm>
#include <queue>

using namespace std;

struct Position {
  int a, b, c;
  Position (int a = 0, int b = 0, int c = 0): a(a), b(b), c(c) { }
};
  

const int COP = 0, ROBBER = 1;
int LeftToWin[2][MAX_N][MAX_N];
int NextPos[MAX_N][MAX_N];

int start(int N, bool A[MAX_N][MAX_N]) {
	for (int r = 0; r < N; r++) {
		int degree = count(A[r], A[r] + N, true);
		for (int c = 0; c < N; c++)
			if (c != r) {
				LeftToWin[COP][c][r] = 1;
				LeftToWin[ROBBER][c][r] = degree;
			}
	}

	queue<Position> q;
	for (int i = 0; i < N; i++) {
		q.push(Position(COP, i, i));
		q.push(Position(ROBBER, i, i));
	}
	
	int numProcessed = 0;
	while (!q.empty()) {
		int t, c, r;
      Position tmp = q.front();
      t = tmp.a; c = tmp.b; r = tmp.c;
		q.pop();
		numProcessed++;
		if (t == COP) {
			for (int n = 0; n < N; n++)
				if (A[r][n] && LeftToWin[ROBBER][c][n]) {
					LeftToWin[ROBBER][c][n]--;
					if (LeftToWin[ROBBER][c][n] == 0)
						q.push(Position(ROBBER, c, n));
				}
		} else if (t == ROBBER) {
			for (int n = 0; n < N; n++)
				if ((c == n || A[c][n]) && LeftToWin[COP][n][r]) {
					LeftToWin[COP][n][r] = 0;
					q.push(Position(COP, n, r));
					NextPos[n][r] = c;
				}
		}
	}
	
	return numProcessed == 2*N*N ? 0 : -1;
}

int cop = 0;

int nextMove(int robber) {
	cop = NextPos[cop][robber];
	return cop;
}

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 313 ms 4648 KB Output is correct
5 Correct 43 ms 2360 KB Output is correct
6 Correct 320 ms 4972 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 266 ms 4628 KB Output is correct
4 Correct 287 ms 4668 KB Output is correct
5 Correct 257 ms 4620 KB Output is correct
6 Correct 292 ms 4524 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 356 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 896 KB Output is correct
11 Correct 4 ms 1100 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 768 KB Output is correct
14 Correct 5 ms 1024 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 8 ms 1280 KB Output is correct
18 Correct 4 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 412 KB Output is correct
4 Correct 272 ms 4668 KB Output is correct
5 Correct 41 ms 2404 KB Output is correct
6 Correct 319 ms 4952 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 388 ms 4708 KB Output is correct
10 Correct 270 ms 4656 KB Output is correct
11 Correct 276 ms 4620 KB Output is correct
12 Correct 301 ms 4600 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 384 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 4 ms 896 KB Output is correct
18 Correct 4 ms 1024 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 5 ms 1024 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Correct 12 ms 1252 KB Output is correct
25 Correct 3 ms 896 KB Output is correct
26 Correct 6 ms 1664 KB Output is correct
27 Correct 18 ms 2944 KB Output is correct
28 Correct 27 ms 3576 KB Output is correct
29 Correct 399 ms 7640 KB Output is correct
30 Correct 81 ms 4096 KB Output is correct
31 Correct 81 ms 4344 KB Output is correct
32 Correct 492 ms 6580 KB Output is correct
33 Correct 94 ms 4216 KB Output is correct
34 Correct 599 ms 7392 KB Output is correct
35 Correct 302 ms 5208 KB Output is correct
36 Correct 607 ms 6312 KB Output is correct
37 Correct 240 ms 3936 KB Output is correct
38 Correct 1 ms 384 KB Output is correct