답안 #308165

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
308165	2020-09-30T07:53:40 Z	fishy15	경찰관과 강도 (BOI14_coprobber)	C++17	100 / 100	745 ms	9720 KB

coprobber

#include <cstring>
#include <array>
#include <iostream>
#include <queue>

using namespace std;

#include "coprobber.h"

int n;
int adj[MAX_N][MAX_N];
int win[MAX_N][MAX_N][2];
int par[MAX_N][MAX_N];
int deg[MAX_N][MAX_N];
int loc = -1;

void solve() {
    queue<array<int, 3>> q;

    for (int end = 0; end < n; end++) {
        q.push({end, end, 0});
        win[end][end][0] = true;
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            deg[0][i] += adj[i][j];
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            deg[i][j] = deg[0][j];
        }
    }

    while (!q.empty()) {
        auto [cop, rob, turn] = q.front();
        q.pop();

        // if it's cop's turn, reduce adjacent robber degrees by 1
        // else if robber's turn, mark adjacent cop moves that they can win there
        if (turn) {
            for (int i = 0; i < n; i++) {
                if (adj[i][rob] && !win[cop][i][0]) {
                    deg[cop][i]--;
                    if (!deg[cop][i]) {
                        win[cop][i][0] = true;
                        q.push({cop, i, 0});
                    }
                }
            }
        } else {
            for (int i = 0; i < n; i++) {
                if ((adj[i][cop] || i == cop) && !win[i][rob][1]) {
                    win[i][rob][1] = true;
                    par[i][rob] = cop;
                    q.push({i, rob, 1});
                }
            }
        }
    }

    for (int start = 0; start < n; start++) {
        int rob = 0;
        for (; rob < n; rob++) {
            if (!win[start][rob][1]) break;
        }

        if (rob == n) {
            loc = start;
        }
    }
}

int start(int N, bool A[MAX_N][MAX_N]) {
    n = N;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            adj[i][j] = A[i][j];
        }
    }

    solve();

    return loc;
}

int nextMove(int R) {
    loc = par[loc][R];
    return loc;
}

Subtask #1
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	447 ms	6648 KB	Output is correct
5	Correct	59 ms	3328 KB	Output is correct
6	Correct	510 ms	6776 KB	Output is correct

Subtask #2
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	453 ms	6620 KB	Output is correct
4	Correct	455 ms	6648 KB	Output is correct
5	Correct	441 ms	6776 KB	Output is correct
6	Correct	484 ms	6520 KB	Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	447 ms	6648 KB	Output is correct
5	Correct	59 ms	3328 KB	Output is correct
6	Correct	510 ms	6776 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	453 ms	6620 KB	Output is correct
10	Correct	455 ms	6648 KB	Output is correct
11	Correct	441 ms	6776 KB	Output is correct
12	Correct	484 ms	6520 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	1 ms	512 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	0 ms	384 KB	Output is correct
20	Correct	1 ms	512 KB	Output is correct
21	Correct	1 ms	512 KB	Output is correct
22	Correct	2 ms	1408 KB	Output is correct
23	Correct	4 ms	1408 KB	Output is correct
24	Correct	1 ms	640 KB	Output is correct
25	Correct	3 ms	1152 KB	Output is correct
26	Correct	6 ms	1408 KB	Output is correct
27	Correct	2 ms	1024 KB	Output is correct
28	Correct	2 ms	1024 KB	Output is correct
29	Correct	8 ms	1664 KB	Output is correct
30	Correct	2 ms	1408 KB	Output is correct
31	Correct	0 ms	384 KB	Output is correct
32	Correct	0 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	1 ms	384 KB	Output is correct
35	Correct	446 ms	6648 KB	Output is correct
36	Correct	59 ms	3328 KB	Output is correct
37	Correct	515 ms	6776 KB	Output is correct
38	Correct	0 ms	384 KB	Output is correct
39	Correct	1 ms	512 KB	Output is correct
40	Correct	469 ms	6756 KB	Output is correct
41	Correct	459 ms	6648 KB	Output is correct
42	Correct	434 ms	6520 KB	Output is correct
43	Correct	470 ms	6636 KB	Output is correct
44	Correct	1 ms	384 KB	Output is correct
45	Correct	1 ms	384 KB	Output is correct
46	Correct	1 ms	512 KB	Output is correct
47	Correct	1 ms	512 KB	Output is correct
48	Correct	2 ms	1408 KB	Output is correct
49	Correct	3 ms	1408 KB	Output is correct
50	Correct	1 ms	640 KB	Output is correct
51	Correct	2 ms	1152 KB	Output is correct
52	Correct	4 ms	1408 KB	Output is correct
53	Correct	2 ms	1024 KB	Output is correct
54	Correct	2 ms	1024 KB	Output is correct
55	Correct	8 ms	1664 KB	Output is correct
56	Correct	2 ms	1408 KB	Output is correct
57	Correct	6 ms	2432 KB	Output is correct
58	Correct	22 ms	4516 KB	Output is correct
59	Correct	38 ms	5496 KB	Output is correct
60	Correct	548 ms	9720 KB	Output is correct
61	Correct	108 ms	6008 KB	Output is correct
62	Correct	118 ms	6272 KB	Output is correct
63	Correct	665 ms	8548 KB	Output is correct
64	Correct	156 ms	6060 KB	Output is correct
65	Correct	685 ms	9244 KB	Output is correct
66	Correct	501 ms	7032 KB	Output is correct
67	Correct	745 ms	8304 KB	Output is correct
68	Correct	358 ms	5884 KB	Output is correct
69	Correct	1 ms	384 KB	Output is correct

답안 #308165

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