답안 #135841

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
135841	2019-07-24T12:20:09 Z	tdwn	경찰관과 강도 (BOI14_coprobber)	C++17	100 / 100	880 ms	10708 KB

coprobber

#include "coprobber.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair

using namespace std;
const int maxn = 510;

class game_state {
public:
	int c, r, turn;
};

bool winning[maxn][maxn][2];
bool visited[maxn][maxn][2];
int g_cnt[maxn][maxn][2];

int g[maxn];

int nxt_move[maxn][maxn][2];
int position;

int start(int N, bool A[MAX_N][MAX_N])
{
	queue<game_state>q;
	for(int i=0;i<N;i++) {
		winning[i][i][0] = winning[i][i][1] = true;
		visited[i][i][0] = winning[i][i][1] = true;
		q.push({i, i, 0});
		q.push({i, i, 1});
	}

	for(int i=0;i<N;i++) {
		for(int j=0;j<N;j++) {
			if(A[i][j]) g[i]++;
		}
	}

	for(int c=0;c<N;c++) {
		for(int r=0;r<N;r++) {
			g_cnt[c][r][1] = g[r];
		}
	}

	// Doing everything backwards
	while(!q.empty()) {
		int cop = q.front().c;
		int robber = q.front().r;
		int turn = q.front().turn;
		q.pop();

		// From which states is this state reachable

		/*cout<<"Winning state is: "<<cop<<" "<<robber<<" with turn on ";
		if(turn == 0) cout<<"police\n";
		else cout<<"robber\n";*/

		if(turn == 1) {
			for(int i=0;i<N;i++) {
				if(i == cop || A[i][cop]) {
					if(!visited[i][robber][0]) {
						winning[i][robber][0] = visited[i][robber][0] = true;

						nxt_move[i][robber][0] = cop;

						q.push({i, robber, 0});
					}
				}
			}
		}
		else {
			// robber's turn, this is winning state, in order to make other state winning state
			// we should make sure each move to that state is winning move

			for(int i=0;i<N;i++) {
				if(A[robber][i]) {
					g_cnt[cop][i][1]--;

					if(g_cnt[cop][i][1] == 0 && !visited[cop][i][1]) {
						visited[cop][i][1] = winning[cop][i][1] = true;

						nxt_move[cop][i][1] = robber;
						q.push({cop, i, 1});
					} 
				}
			}
		}
	}

	for(int cop=0;cop<N;cop++) {
		int br = 0;
		for(int r=0;r<N;r++) {
			if(winning[cop][r][0]) br++;
		}
		if(br == N) {
			position = cop;
			return cop;
		}
	}
	return -1;
}

int nextMove(int R)
{
    return position = nxt_move[position][R][0];
}

Subtask #1
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	364 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	504 KB	Output is correct
4	Correct	313 ms	7680 KB	Output is correct
5	Correct	51 ms	3832 KB	Output is correct
6	Correct	404 ms	7640 KB	Output is correct

Subtask #2
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	504 KB	Output is correct
3	Correct	338 ms	8160 KB	Output is correct
4	Correct	329 ms	8276 KB	Output is correct
5	Correct	329 ms	8036 KB	Output is correct
6	Correct	323 ms	7928 KB	Output is correct

Subtask #3
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	504 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	504 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	504 KB	Output is correct
9	Correct	2 ms	632 KB	Output is correct
10	Correct	4 ms	1400 KB	Output is correct
11	Correct	5 ms	1528 KB	Output is correct
12	Correct	2 ms	632 KB	Output is correct
13	Correct	3 ms	1144 KB	Output is correct
14	Correct	6 ms	1400 KB	Output is correct
15	Correct	4 ms	1016 KB	Output is correct
16	Correct	4 ms	1048 KB	Output is correct
17	Correct	9 ms	1784 KB	Output is correct
18	Correct	4 ms	1400 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct

Subtask #4
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	364 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	504 KB	Output is correct
4	Correct	313 ms	7680 KB	Output is correct
5	Correct	51 ms	3832 KB	Output is correct
6	Correct	404 ms	7640 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	504 KB	Output is correct
9	Correct	338 ms	8160 KB	Output is correct
10	Correct	329 ms	8276 KB	Output is correct
11	Correct	329 ms	8036 KB	Output is correct
12	Correct	323 ms	7928 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	504 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	504 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	504 KB	Output is correct
21	Correct	2 ms	632 KB	Output is correct
22	Correct	4 ms	1400 KB	Output is correct
23	Correct	5 ms	1528 KB	Output is correct
24	Correct	2 ms	632 KB	Output is correct
25	Correct	3 ms	1144 KB	Output is correct
26	Correct	6 ms	1400 KB	Output is correct
27	Correct	4 ms	1016 KB	Output is correct
28	Correct	4 ms	1048 KB	Output is correct
29	Correct	9 ms	1784 KB	Output is correct
30	Correct	4 ms	1400 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	2 ms	504 KB	Output is correct
34	Correct	2 ms	476 KB	Output is correct
35	Correct	316 ms	8144 KB	Output is correct
36	Correct	50 ms	3704 KB	Output is correct
37	Correct	405 ms	8312 KB	Output is correct
38	Correct	2 ms	376 KB	Output is correct
39	Correct	2 ms	504 KB	Output is correct
40	Correct	323 ms	8164 KB	Output is correct
41	Correct	318 ms	8188 KB	Output is correct
42	Correct	382 ms	7960 KB	Output is correct
43	Correct	326 ms	8060 KB	Output is correct
44	Correct	2 ms	376 KB	Output is correct
45	Correct	2 ms	380 KB	Output is correct
46	Correct	2 ms	492 KB	Output is correct
47	Correct	2 ms	504 KB	Output is correct
48	Correct	4 ms	1400 KB	Output is correct
49	Correct	5 ms	1528 KB	Output is correct
50	Correct	3 ms	632 KB	Output is correct
51	Correct	4 ms	1144 KB	Output is correct
52	Correct	6 ms	1528 KB	Output is correct
53	Correct	4 ms	1016 KB	Output is correct
54	Correct	4 ms	1016 KB	Output is correct
55	Correct	10 ms	1784 KB	Output is correct
56	Correct	4 ms	1400 KB	Output is correct
57	Correct	8 ms	2552 KB	Output is correct
58	Correct	21 ms	4984 KB	Output is correct
59	Correct	32 ms	6136 KB	Output is correct
60	Correct	505 ms	10616 KB	Output is correct
61	Correct	196 ms	6488 KB	Output is correct
62	Correct	167 ms	6992 KB	Output is correct
63	Correct	681 ms	9720 KB	Output is correct
64	Correct	268 ms	6648 KB	Output is correct
65	Correct	880 ms	10708 KB	Output is correct
66	Correct	378 ms	8384 KB	Output is correct
67	Correct	805 ms	9740 KB	Output is correct
68	Correct	327 ms	6520 KB	Output is correct
69	Correct	2 ms	376 KB	Output is correct

답안 #135841

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 14.0 / 14.0

Subtask #3 30.0 / 30.0

Subtask #4 40.0 / 40.0

Subtask #1
16.0 / 16.0

Subtask #2
14.0 / 14.0

Subtask #3
30.0 / 30.0

Subtask #4
40.0 / 40.0