oj.uz

답안 #230088

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
230088 2020-05-08T06:57:18 Z dolphingarlic 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 507 ms 7648 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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 248 ms 4652 KB Output is correct
5 Correct 47 ms 2432 KB Output is correct
6 Correct 284 ms 4984 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 243 ms 4800 KB Output is correct
4 Correct 269 ms 4728 KB Output is correct
5 Correct 239 ms 4660 KB Output is correct
6 Correct 286 ms 4728 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 640 KB Output is correct
10 Correct 6 ms 896 KB Output is correct
11 Correct 7 ms 1024 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 5 ms 768 KB Output is correct
14 Correct 7 ms 1024 KB Output is correct
15 Correct 6 ms 768 KB Output is correct
16 Correct 6 ms 768 KB Output is correct
17 Correct 11 ms 1280 KB Output is correct
18 Correct 6 ms 1020 KB Output is correct
19 Correct 4 ms 384 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 248 ms 4652 KB Output is correct
5 Correct 47 ms 2432 KB Output is correct
6 Correct 284 ms 4984 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 243 ms 4800 KB Output is correct
10 Correct 269 ms 4728 KB Output is correct
11 Correct 239 ms 4660 KB Output is correct
12 Correct 286 ms 4728 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 4 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 5 ms 640 KB Output is correct
22 Correct 6 ms 896 KB Output is correct
23 Correct 7 ms 1024 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 5 ms 768 KB Output is correct
26 Correct 7 ms 1024 KB Output is correct
27 Correct 6 ms 768 KB Output is correct
28 Correct 6 ms 768 KB Output is correct
29 Correct 11 ms 1280 KB Output is correct
30 Correct 6 ms 1020 KB Output is correct
31 Correct 4 ms 384 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 4 ms 384 KB Output is correct
35 Correct 256 ms 4728 KB Output is correct
36 Correct 44 ms 2432 KB Output is correct
37 Correct 286 ms 4964 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 259 ms 4640 KB Output is correct
41 Correct 256 ms 4732 KB Output is correct
42 Correct 239 ms 4728 KB Output is correct
43 Correct 266 ms 4616 KB Output is correct
44 Correct 5 ms 512 KB Output is correct
45 Correct 4 ms 384 KB Output is correct
46 Correct 4 ms 384 KB Output is correct
47 Correct 5 ms 512 KB Output is correct
48 Correct 6 ms 896 KB Output is correct
49 Correct 7 ms 1024 KB Output is correct
50 Correct 4 ms 512 KB Output is correct
51 Correct 5 ms 768 KB Output is correct
52 Correct 7 ms 1024 KB Output is correct
53 Correct 6 ms 768 KB Output is correct
54 Correct 6 ms 768 KB Output is correct
55 Correct 11 ms 1280 KB Output is correct
56 Correct 6 ms 1024 KB Output is correct
57 Correct 11 ms 1792 KB Output is correct
58 Correct 24 ms 2816 KB Output is correct
59 Correct 33 ms 3584 KB Output is correct
60 Correct 398 ms 7648 KB Output is correct
61 Correct 88 ms 4320 KB Output is correct
62 Correct 82 ms 4352 KB Output is correct
63 Correct 424 ms 6392 KB Output is correct
64 Correct 99 ms 4216 KB Output is correct
65 Correct 491 ms 7316 KB Output is correct
66 Correct 286 ms 5112 KB Output is correct
67 Correct 507 ms 6232 KB Output is correct
68 Correct 218 ms 3996 KB Output is correct
69 Correct 5 ms 384 KB Output is correct