oj.uz

답안 #398836

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
398836 2021-05-04T21:10:13 Z faresbasbs 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 678 ms 7544 KB 
#include <bits/stdc++.h>
#include "coprobber.h"
using namespace std;

struct node{
	int cop,rob,tag;
};

int n,curr,moves[501][501],win[501][501][2];
queue<node> q;

int start(int N , bool grid[MAX_N][MAX_N]){
	n = N;
	for(int i = 0 ; i < n ; i += 1){
		int cnt = 0;
		for(int j = 0 ; j < n ; j += 1){
			cnt += grid[i][j];
		}
		for(int j = 0 ; j < n ; j += 1){
			if(j != i){
				win[j][i][0] = 1 , win[j][i][1] = cnt;
			}
		}
	}
	for(int i = 0 ; i < n ; i += 1){
		q.push({i,i,0}),q.push({i,i,1});
	}
	while(q.size()){
		node nxt = q.front();
		q.pop();
		if(nxt.tag == 0){
			for(int i = 0 ; i < n ; i += 1){
				if(grid[nxt.rob][i] && win[nxt.cop][i][1]){
					win[nxt.cop][i][1] -= 1;
					if(!win[nxt.cop][i][1]){
						q.push({nxt.cop,i,1});
					}
				}
			}
		}else{
			for(int i = 0 ; i < n ; i += 1){
				if(win[i][nxt.rob][0] && (i == nxt.cop || grid[nxt.cop][i])){
					win[i][nxt.rob][0] -= 1;
					q.push({i,nxt.rob,0});
					moves[i][nxt.rob] = nxt.cop;
				}
			}
		}
	}
	for(int i = 0 ; i < n ; i += 1){
		if(win[0][i][0]){
			return -1;
		}
	}
	return 0;
}

int nextMove(int r){
	return curr = moves[curr][r];
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 458 ms 4672 KB Output is correct
5 Correct 77 ms 2496 KB Output is correct
6 Correct 627 ms 4876 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 520 ms 4604 KB Output is correct
4 Correct 458 ms 4672 KB Output is correct
5 Correct 537 ms 4732 KB Output is correct
6 Correct 511 ms 4560 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 2 ms 840 KB Output is correct
11 Correct 3 ms 968 KB Output is correct
12 Correct 1 ms 456 KB Output is correct
13 Correct 2 ms 712 KB Output is correct
14 Correct 4 ms 968 KB Output is correct
15 Correct 2 ms 712 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 8 ms 1224 KB Output is correct
18 Correct 2 ms 840 KB Output is correct
19 Correct 1 ms 328 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 458 ms 4672 KB Output is correct
5 Correct 77 ms 2496 KB Output is correct
6 Correct 627 ms 4876 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 520 ms 4604 KB Output is correct
10 Correct 458 ms 4672 KB Output is correct
11 Correct 537 ms 4732 KB Output is correct
12 Correct 511 ms 4560 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 456 KB Output is correct
22 Correct 2 ms 840 KB Output is correct
23 Correct 3 ms 968 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 2 ms 712 KB Output is correct
26 Correct 4 ms 968 KB Output is correct
27 Correct 2 ms 712 KB Output is correct
28 Correct 3 ms 768 KB Output is correct
29 Correct 8 ms 1224 KB Output is correct
30 Correct 2 ms 840 KB Output is correct
31 Correct 1 ms 328 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 1 ms 328 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 456 ms 4588 KB Output is correct
36 Correct 88 ms 2320 KB Output is correct
37 Correct 632 ms 4932 KB Output is correct
38 Correct 1 ms 328 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 524 ms 4588 KB Output is correct
41 Correct 452 ms 4672 KB Output is correct
42 Correct 525 ms 4580 KB Output is correct
43 Correct 496 ms 4444 KB Output is correct
44 Correct 1 ms 328 KB Output is correct
45 Correct 1 ms 328 KB Output is correct
46 Correct 1 ms 328 KB Output is correct
47 Correct 1 ms 456 KB Output is correct
48 Correct 2 ms 844 KB Output is correct
49 Correct 3 ms 968 KB Output is correct
50 Correct 1 ms 456 KB Output is correct
51 Correct 2 ms 712 KB Output is correct
52 Correct 4 ms 968 KB Output is correct
53 Correct 2 ms 712 KB Output is correct
54 Correct 2 ms 712 KB Output is correct
55 Correct 8 ms 1224 KB Output is correct
56 Correct 2 ms 840 KB Output is correct
57 Correct 6 ms 1608 KB Output is correct
58 Correct 19 ms 2856 KB Output is correct
59 Correct 41 ms 3532 KB Output is correct
60 Correct 493 ms 7544 KB Output is correct
61 Correct 105 ms 4096 KB Output is correct
62 Correct 116 ms 4328 KB Output is correct
63 Correct 678 ms 6500 KB Output is correct
64 Correct 176 ms 4124 KB Output is correct
65 Correct 562 ms 7320 KB Output is correct
66 Correct 549 ms 5132 KB Output is correct
67 Correct 665 ms 6360 KB Output is correct
68 Correct 344 ms 3860 KB Output is correct
69 Correct 1 ms 328 KB Output is correct