oj.uz

Submission #967502

# Submission time Handle Problem Language Result Execution time Memory
967502 2024-04-22T09:19:01 Z mdbrnowski Cop and Robber (BOI14_coprobber) C++17
100 / 100
 359 ms 7956 KB 
#include "coprobber.h"
#include <bits/stdc++.h>

using namespace std;

int next_move[MAX_N][MAX_N];
int left_to_win_C[MAX_N][MAX_N];
int left_to_win_R[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) continue;
            left_to_win_C[c][r] = 1;
            left_to_win_R[c][r] = degree;
        }
    }

    queue<tuple<int,int,char>> q;
    for (int i = 0; i < N; i++)
        q.push({i, i, 'C'}),
        q.push({i, i, 'R'});

    int winnable = 0;
    while (q.size()) {
        auto [c, r, who] = q.front(); q.pop();
        winnable++;
        if (who == 'C') {
            for (int i = 0; i < N; i++) {
                if (A[r][i] && left_to_win_R[c][i]) {
                    left_to_win_R[c][i]--;
                    if (left_to_win_R[c][i] == 0)
                        q.push({c, i, 'R'});
                }
            }
        } else if (who == 'R') {
            for (int i = 0; i < N; i++) {
                if ((A[c][i] || c == i) && left_to_win_C[i][r]) {
                    left_to_win_C[i][r] = 0;
                    q.push({i, r, 'C'});
                    next_move[i][r] = c;
                }
            }
        }
    }
    return (winnable == 2 * N * N) ? 0 : -1;
}

int C = 0;

int nextMove(int R) {
    return C = next_move[C][R];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 2 ms 4596 KB Output is correct
4 Correct 232 ms 4632 KB Output is correct
5 Correct 29 ms 4788 KB Output is correct
6 Correct 208 ms 5156 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 196 ms 5004 KB Output is correct
4 Correct 200 ms 4632 KB Output is correct
5 Correct 230 ms 5036 KB Output is correct
6 Correct 209 ms 4656 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory 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 2 ms 4532 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4696 KB Output is correct
14 Correct 3 ms 4744 KB Output is correct
15 Correct 2 ms 4440 KB Output is correct
16 Correct 2 ms 4440 KB Output is correct
17 Correct 6 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 2 ms 4596 KB Output is correct
4 Correct 232 ms 4632 KB Output is correct
5 Correct 29 ms 4788 KB Output is correct
6 Correct 208 ms 5156 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 196 ms 5004 KB Output is correct
10 Correct 200 ms 4632 KB Output is correct
11 Correct 230 ms 5036 KB Output is correct
12 Correct 209 ms 4656 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 2 ms 4532 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 1 ms 4696 KB Output is correct
26 Correct 3 ms 4744 KB Output is correct
27 Correct 2 ms 4440 KB Output is correct
28 Correct 2 ms 4440 KB Output is correct
29 Correct 6 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 204 ms 4628 KB Output is correct
36 Correct 28 ms 4812 KB Output is correct
37 Correct 217 ms 5356 KB Output is correct
38 Correct 1 ms 4440 KB Output is correct
39 Correct 1 ms 4440 KB Output is correct
40 Correct 201 ms 4836 KB Output is correct
41 Correct 210 ms 5096 KB Output is correct
42 Correct 198 ms 4900 KB Output is correct
43 Correct 214 ms 4648 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 1 ms 4696 KB Output is correct
49 Correct 2 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 3 ms 4696 KB Output is correct
53 Correct 1 ms 4440 KB Output is correct
54 Correct 2 ms 4440 KB Output is correct
55 Correct 6 ms 4696 KB Output is correct
56 Correct 1 ms 4696 KB Output is correct
57 Correct 3 ms 4696 KB Output is correct
58 Correct 11 ms 4564 KB Output is correct
59 Correct 20 ms 4860 KB Output is correct
60 Correct 283 ms 7956 KB Output is correct
61 Correct 57 ms 5760 KB Output is correct
62 Correct 53 ms 5644 KB Output is correct
63 Correct 312 ms 6776 KB Output is correct
64 Correct 48 ms 5368 KB Output is correct
65 Correct 353 ms 7700 KB Output is correct
66 Correct 195 ms 5652 KB Output is correct
67 Correct 359 ms 6696 KB Output is correct
68 Correct 131 ms 5236 KB Output is correct
69 Correct 1 ms 4440 KB Output is correct