oj.uz

Submission #763051

# Submission time Handle Problem Language Result Execution time Memory
763051 2023-06-22T02:48:25 Z boyliguanhan Cop and Robber (BOI14_coprobber) C++17
100 / 100
 275 ms 6740 KB 
#include "coprobber.h"
#include<vector>
#pragma GCC optimize(2)
int ok[MAX_N][MAX_N][2], move[MAX_N][MAX_N], vis[MAX_N][MAX_N][2], sz[MAX_N][MAX_N];
bool a[MAX_N][MAX_N];
std::vector<int> adj[MAX_N];
int pos;
void dfs(int x, int y, int who)
{
    ok[x][y][who] = 1;
    if (who == 1) {
        for (auto i : adj[x]) {
            if (!ok[i][y][0]) {
                move[i][y] = x;
                dfs(i, y, 0);
            }
        }
        if (!ok[x][y][0]) {
            move[x][y] = x;
            dfs(x, y, 0);
        }
    }
    else {
        for (auto i : adj[y]) {
            sz[x][i]--;
            if (!sz[x][i] && !ok[x][i][1])
                dfs(x, i, 1);
        }
    }
}
int start(int N, bool A[MAX_N][MAX_N])
{
    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++)
            if (A[i][j])
                adj[i].push_back(j);
    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++)
            sz[i][j] = adj[j].size();
    for (int i = 0; i < N; i++) {
        if (!ok[i][i][0])
            dfs(i, i , 0);
        if (!ok[i][i][1])
            dfs(i, i, 1);
    }
    for (pos = 0; pos < N; pos++) {
        bool still = 1;
        for (int i = 0; i < N; i++)
            if (!ok[pos][i][0])
                still = 0;
        if (still)
            return pos;
    }
    return -1;
}

int nextMove(int R)
{
    return pos=move[pos][R];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 45 ms 5772 KB Output is correct
5 Correct 13 ms 2768 KB Output is correct
6 Correct 42 ms 5412 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 37 ms 5556 KB Output is correct
4 Correct 39 ms 5832 KB Output is correct
5 Correct 36 ms 5420 KB Output is correct
6 Correct 37 ms 5608 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 464 KB Output is correct
10 Correct 1 ms 1104 KB Output is correct
11 Correct 2 ms 1104 KB Output is correct
12 Correct 0 ms 464 KB Output is correct
13 Correct 1 ms 848 KB Output is correct
14 Correct 2 ms 1104 KB Output is correct
15 Correct 1 ms 848 KB Output is correct
16 Correct 1 ms 848 KB Output is correct
17 Correct 4 ms 1360 KB Output is correct
18 Correct 1 ms 1104 KB Output is correct
19 Correct 0 ms 336 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 45 ms 5772 KB Output is correct
5 Correct 13 ms 2768 KB Output is correct
6 Correct 42 ms 5412 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 37 ms 5556 KB Output is correct
10 Correct 39 ms 5832 KB Output is correct
11 Correct 36 ms 5420 KB Output is correct
12 Correct 37 ms 5608 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 ms 336 KB Output is correct
15 Correct 0 ms 336 KB Output is correct
16 Correct 0 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 0 ms 464 KB Output is correct
22 Correct 1 ms 1104 KB Output is correct
23 Correct 2 ms 1104 KB Output is correct
24 Correct 0 ms 464 KB Output is correct
25 Correct 1 ms 848 KB Output is correct
26 Correct 2 ms 1104 KB Output is correct
27 Correct 1 ms 848 KB Output is correct
28 Correct 1 ms 848 KB Output is correct
29 Correct 4 ms 1360 KB Output is correct
30 Correct 1 ms 1104 KB Output is correct
31 Correct 0 ms 336 KB Output is correct
32 Correct 0 ms 336 KB Output is correct
33 Correct 0 ms 336 KB Output is correct
34 Correct 0 ms 336 KB Output is correct
35 Correct 42 ms 5756 KB Output is correct
36 Correct 10 ms 2800 KB Output is correct
37 Correct 48 ms 5492 KB Output is correct
38 Correct 0 ms 336 KB Output is correct
39 Correct 0 ms 336 KB Output is correct
40 Correct 37 ms 5536 KB Output is correct
41 Correct 51 ms 5808 KB Output is correct
42 Correct 36 ms 5496 KB Output is correct
43 Correct 37 ms 5580 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 0 ms 336 KB Output is correct
46 Correct 0 ms 336 KB Output is correct
47 Correct 0 ms 464 KB Output is correct
48 Correct 1 ms 1104 KB Output is correct
49 Correct 2 ms 1116 KB Output is correct
50 Correct 1 ms 464 KB Output is correct
51 Correct 1 ms 848 KB Output is correct
52 Correct 2 ms 1104 KB Output is correct
53 Correct 1 ms 848 KB Output is correct
54 Correct 1 ms 848 KB Output is correct
55 Correct 3 ms 1348 KB Output is correct
56 Correct 1 ms 1104 KB Output is correct
57 Correct 4 ms 1884 KB Output is correct
58 Correct 12 ms 3664 KB Output is correct
59 Correct 18 ms 4412 KB Output is correct
60 Correct 275 ms 6568 KB Output is correct
61 Correct 31 ms 4432 KB Output is correct
62 Correct 30 ms 4936 KB Output is correct
63 Correct 205 ms 6512 KB Output is correct
64 Correct 30 ms 4552 KB Output is correct
65 Correct 221 ms 6740 KB Output is correct
66 Correct 43 ms 5248 KB Output is correct
67 Correct 114 ms 5988 KB Output is correct
68 Correct 40 ms 4660 KB Output is correct
69 Correct 0 ms 336 KB Output is correct