oj.uz

답안 #873607

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
873607 2023-11-15T11:26:26 Z sleepntsheep 경찰관과 강도 (BOI14_coprobber) C++17
100 / 100
 853 ms 10016 KB 
#include "coprobber.h"
#include <tuple>
#include <array>
#include <queue>
#include <string.h>

int N, G[MAX_N][MAX_N][2], C[MAX_N][MAX_N], D[MAX_N][MAX_N], deg[MAX_N], at;
bool (*A)[MAX_N];

int start(int N, bool A[MAX_N][MAX_N])
{
    ::N = N, ::A = A;
    std::queue<std::tuple<int, int, int, int>> q;
    for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) deg[i] += A[i][j], G[i][j][0] = G[i][j][1] = 1;
    for (int i = 0; i < N; ++i) G[i][i][0] = G[i][i][1] = 0, q.emplace(i, i, 0, 0), q.emplace(i, i, 1, 0);

    for (; q.size(); )
    {
        auto [u, v, t, g] = q.front();
        q.pop();
        if (t) /* robber, was cop */
        {
            for (auto k = 0; k < N; ++k)
            {
                if (!A[u][k] && k != u) continue;
                if (G[k][v][!t])
                    q.emplace(k, v, !t, G[k][v][!t] = 0), D[k][v] = u;
            }
        }
        else /* was robber */
        {
            for (auto k = 0; k < N; ++k)
            {
                if (!A[v][k]) continue;
                if (++C[u][k] == deg[k])
                    q.emplace(u, k, !t, G[u][k][!t] = 0);
            }
        }
    }

    for (int win = 0, i = 0; i < N; ++i)
        for (int j = win = 0; j < N; ++j) if ((win += !G[i][j][0]) == N) return at = i;
    return -1;
}

int nextMove(int R)
{
    return at = D[at][R];
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4436 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 659 ms 5796 KB Output is correct
5 Correct 78 ms 5164 KB Output is correct
6 Correct 689 ms 6316 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 2 ms 4440 KB Output is correct
3 Correct 643 ms 5788 KB Output is correct
4 Correct 663 ms 5808 KB Output is correct
5 Correct 610 ms 6016 KB Output is correct
6 Correct 670 ms 5832 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 2 ms 4696 KB Output is correct
11 Correct 3 ms 4696 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 2 ms 4696 KB Output is correct
14 Correct 4 ms 4696 KB Output is correct
15 Correct 2 ms 4696 KB Output is correct
16 Correct 2 ms 4696 KB Output is correct
17 Correct 8 ms 4696 KB Output is correct
18 Correct 1 ms 4696 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4436 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 659 ms 5796 KB Output is correct
5 Correct 78 ms 5164 KB Output is correct
6 Correct 689 ms 6316 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 2 ms 4440 KB Output is correct
9 Correct 643 ms 5788 KB Output is correct
10 Correct 663 ms 5808 KB Output is correct
11 Correct 610 ms 6016 KB Output is correct
12 Correct 670 ms 5832 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 2 ms 4440 KB Output is correct
17 Correct 1 ms 4440 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4440 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 2 ms 4696 KB Output is correct
23 Correct 3 ms 4696 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 2 ms 4696 KB Output is correct
26 Correct 4 ms 4696 KB Output is correct
27 Correct 2 ms 4696 KB Output is correct
28 Correct 2 ms 4696 KB Output is correct
29 Correct 8 ms 4696 KB Output is correct
30 Correct 1 ms 4696 KB Output is correct
31 Correct 1 ms 4440 KB Output is correct
32 Correct 1 ms 4440 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Correct 1 ms 4440 KB Output is correct
35 Correct 660 ms 5800 KB Output is correct
36 Correct 79 ms 5288 KB Output is correct
37 Correct 669 ms 6328 KB Output is correct
38 Correct 1 ms 4440 KB Output is correct
39 Correct 1 ms 4440 KB Output is correct
40 Correct 642 ms 5964 KB Output is correct
41 Correct 668 ms 5768 KB Output is correct
42 Correct 621 ms 6044 KB Output is correct
43 Correct 680 ms 6028 KB Output is correct
44 Correct 1 ms 4440 KB Output is correct
45 Correct 1 ms 4440 KB Output is correct
46 Correct 1 ms 4440 KB Output is correct
47 Correct 1 ms 4440 KB Output is correct
48 Correct 2 ms 4696 KB Output is correct
49 Correct 3 ms 4696 KB Output is correct
50 Correct 1 ms 4440 KB Output is correct
51 Correct 2 ms 4696 KB Output is correct
52 Correct 4 ms 4696 KB Output is correct
53 Correct 3 ms 4696 KB Output is correct
54 Correct 3 ms 4696 KB Output is correct
55 Correct 8 ms 4696 KB Output is correct
56 Correct 1 ms 4696 KB Output is correct
57 Correct 6 ms 4952 KB Output is correct
58 Correct 15 ms 5396 KB Output is correct
59 Correct 25 ms 5688 KB Output is correct
60 Correct 704 ms 10016 KB Output is correct
61 Correct 119 ms 6968 KB Output is correct
62 Correct 117 ms 6940 KB Output is correct
63 Correct 824 ms 8668 KB Output is correct
64 Correct 150 ms 6428 KB Output is correct
65 Correct 853 ms 9464 KB Output is correct
66 Correct 609 ms 6892 KB Output is correct
67 Correct 819 ms 8116 KB Output is correct
68 Correct 361 ms 6328 KB Output is correct
69 Correct 1 ms 4440 KB Output is correct