답안 #229782

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
229782	2020-05-06T12:30:37 Z	Nicksechko	경찰관과 강도 (BOI14_coprobber)	C++14	100 / 100	487 ms	7800 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	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	244 ms	4728 KB	Output is correct
5	Correct	42 ms	2432 KB	Output is correct
6	Correct	279 ms	4856 KB	Output is correct

Subtask #2
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	384 KB	Output is correct
2	Correct	4 ms	512 KB	Output is correct
3	Correct	262 ms	4756 KB	Output is correct
4	Correct	260 ms	4656 KB	Output is correct
5	Correct	227 ms	4632 KB	Output is correct
6	Correct	273 ms	4544 KB	Output is correct

Subtask #3
30.0 / 30.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	4 ms	384 KB	Output is correct
5	Correct	4 ms	512 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	512 KB	Output is correct
10	Correct	6 ms	1024 KB	Output is correct
11	Correct	7 ms	1024 KB	Output is correct
12	Correct	5 ms	512 KB	Output is correct
13	Correct	6 ms	896 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	896 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	244 ms	4728 KB	Output is correct
5	Correct	42 ms	2432 KB	Output is correct
6	Correct	279 ms	4856 KB	Output is correct
7	Correct	4 ms	384 KB	Output is correct
8	Correct	4 ms	512 KB	Output is correct
9	Correct	262 ms	4756 KB	Output is correct
10	Correct	260 ms	4656 KB	Output is correct
11	Correct	227 ms	4632 KB	Output is correct
12	Correct	273 ms	4544 KB	Output is correct
13	Correct	4 ms	384 KB	Output is correct
14	Correct	4 ms	384 KB	Output is correct
15	Correct	4 ms	384 KB	Output is correct
16	Correct	4 ms	384 KB	Output is correct
17	Correct	4 ms	512 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	4 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	5 ms	512 KB	Output is correct
22	Correct	6 ms	1024 KB	Output is correct
23	Correct	7 ms	1024 KB	Output is correct
24	Correct	5 ms	512 KB	Output is correct
25	Correct	6 ms	896 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	896 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	5 ms	384 KB	Output is correct
35	Correct	243 ms	4684 KB	Output is correct
36	Correct	47 ms	2552 KB	Output is correct
37	Correct	267 ms	4808 KB	Output is correct
38	Correct	4 ms	384 KB	Output is correct
39	Correct	4 ms	384 KB	Output is correct
40	Correct	249 ms	4664 KB	Output is correct
41	Correct	244 ms	4764 KB	Output is correct
42	Correct	227 ms	4656 KB	Output is correct
43	Correct	248 ms	4600 KB	Output is correct
44	Correct	4 ms	384 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	1024 KB	Output is correct
49	Correct	7 ms	1024 KB	Output is correct
50	Correct	5 ms	512 KB	Output is correct
51	Correct	6 ms	768 KB	Output is correct
52	Correct	7 ms	1024 KB	Output is correct
53	Correct	7 ms	896 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	896 KB	Output is correct
57	Correct	11 ms	1664 KB	Output is correct
58	Correct	23 ms	2816 KB	Output is correct
59	Correct	36 ms	3576 KB	Output is correct
60	Correct	399 ms	7800 KB	Output is correct
61	Correct	85 ms	4216 KB	Output is correct
62	Correct	80 ms	4344 KB	Output is correct
63	Correct	409 ms	6648 KB	Output is correct
64	Correct	101 ms	4140 KB	Output is correct
65	Correct	480 ms	7324 KB	Output is correct
66	Correct	268 ms	5240 KB	Output is correct
67	Correct	487 ms	6288 KB	Output is correct
68	Correct	212 ms	4044 KB	Output is correct
69	Correct	4 ms	384 KB	Output is correct

답안 #229782

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