답안 #398220

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
398220	2021-05-04T00:56:45 Z	mars	경찰관과 강도 (BOI14_coprobber)	C++14	100 / 100	548 ms	7556 KB

coprobber

/**
 * Official solution for Cop and Robber.
 *
 * Implements the idea described in the spoiler. LeftToWin array
 * counts how many winning moves are necessary to declare the position
 * as winning. The cop's winning strategy is stored in NextPos array.
 *
 * This file must be compiled in C++11 mode.
 *
 * Author: Marijonas Petrauskas
 */

#include "coprobber.h"
#include <algorithm>
#include <queue>
#include <tuple>

using namespace std;

typedef tuple<int, int, int> Position;

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;
        tie(t, c, r) = q.front();
        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	1 ms	200 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	328 KB	Output is correct
4	Correct	280 ms	4572 KB	Output is correct
5	Correct	42 ms	2368 KB	Output is correct
6	Correct	292 ms	4848 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	291 ms	4632 KB	Output is correct
4	Correct	283 ms	4612 KB	Output is correct
5	Correct	263 ms	4580 KB	Output is correct
6	Correct	305 ms	4500 KB	Output is correct

Subtask #3
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	200 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	328 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	328 KB	Output is correct
8	Correct	1 ms	328 KB	Output is correct
9	Correct	1 ms	328 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	840 KB	Output is correct
15	Correct	2 ms	712 KB	Output is correct
16	Correct	2 ms	712 KB	Output is correct
17	Correct	8 ms	1224 KB	Output is correct
18	Correct	2 ms	840 KB	Output is correct
19	Correct	0 ms	328 KB	Output is correct

Subtask #4
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	200 KB	Output is correct
2	Correct	1 ms	328 KB	Output is correct
3	Correct	1 ms	328 KB	Output is correct
4	Correct	280 ms	4572 KB	Output is correct
5	Correct	42 ms	2368 KB	Output is correct
6	Correct	292 ms	4848 KB	Output is correct
7	Correct	1 ms	328 KB	Output is correct
8	Correct	1 ms	328 KB	Output is correct
9	Correct	291 ms	4632 KB	Output is correct
10	Correct	283 ms	4612 KB	Output is correct
11	Correct	263 ms	4580 KB	Output is correct
12	Correct	305 ms	4500 KB	Output is correct
13	Correct	1 ms	200 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	1 ms	328 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	328 KB	Output is correct
20	Correct	1 ms	328 KB	Output is correct
21	Correct	1 ms	328 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	840 KB	Output is correct
27	Correct	2 ms	712 KB	Output is correct
28	Correct	2 ms	712 KB	Output is correct
29	Correct	8 ms	1224 KB	Output is correct
30	Correct	2 ms	840 KB	Output is correct
31	Correct	0 ms	328 KB	Output is correct
32	Correct	1 ms	200 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	328 KB	Output is correct
35	Correct	281 ms	4636 KB	Output is correct
36	Correct	45 ms	2368 KB	Output is correct
37	Correct	298 ms	4928 KB	Output is correct
38	Correct	1 ms	328 KB	Output is correct
39	Correct	1 ms	328 KB	Output is correct
40	Correct	274 ms	4660 KB	Output is correct
41	Correct	280 ms	4572 KB	Output is correct
42	Correct	260 ms	4560 KB	Output is correct
43	Correct	301 ms	4448 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	328 KB	Output is correct
48	Correct	2 ms	840 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	840 KB	Output is correct
53	Correct	2 ms	712 KB	Output is correct
54	Correct	2 ms	712 KB	Output is correct
55	Correct	9 ms	1180 KB	Output is correct
56	Correct	2 ms	840 KB	Output is correct
57	Correct	6 ms	1480 KB	Output is correct
58	Correct	19 ms	2736 KB	Output is correct
59	Correct	30 ms	3428 KB	Output is correct
60	Correct	477 ms	7556 KB	Output is correct
61	Correct	87 ms	4052 KB	Output is correct
62	Correct	82 ms	4296 KB	Output is correct
63	Correct	456 ms	6460 KB	Output is correct
64	Correct	104 ms	4000 KB	Output is correct
65	Correct	544 ms	7252 KB	Output is correct
66	Correct	303 ms	5040 KB	Output is correct
67	Correct	548 ms	6412 KB	Output is correct
68	Correct	223 ms	3848 KB	Output is correct
69	Correct	1 ms	328 KB	Output is correct

답안 #398220

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