oj.uz

답안 #837963

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
837963 2023-08-25T23:48:12 Z boyliguanhan 경찰관과 강도 (BOI14_coprobber) C++17
100 / 100
 267 ms 6604 KB 
#include "coprobber.h"
#include<vector>
#define NN 500
#pragma GCC optimize(2)
int ok[NN][NN][2], nxt[NN][NN], vis[NN][NN][2], sz[NN][NN];
bool a[NN][NN];
std::vector<int> adj[NN];
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])
                nxt[i][y] = x,dfs(i, y, 0);
        if (!ok[x][y][0])
            nxt[x][y] = x,dfs(x, y, 0);
    } else
        for (auto i : adj[y])
            if (!--sz[x][i] && !ok[x][i][1])
                dfs(x, i, 1);
}
int start(int N, bool A[NN][NN])
{
    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=nxt[pos][R];
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 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 40 ms 5756 KB Output is correct
5 Correct 12 ms 2768 KB Output is correct
6 Correct 41 ms 5408 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 51 ms 5592 KB Output is correct
4 Correct 44 ms 5736 KB Output is correct
5 Correct 36 ms 5444 KB Output is correct
6 Correct 38 ms 5612 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 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 1 ms 336 KB Output is correct
9 Correct 1 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 2 ms 828 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 3 ms 1360 KB Output is correct
18 Correct 1 ms 1088 KB Output is correct
19 Correct 0 ms 336 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 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 40 ms 5756 KB Output is correct
5 Correct 12 ms 2768 KB Output is correct
6 Correct 41 ms 5408 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 51 ms 5592 KB Output is correct
10 Correct 44 ms 5736 KB Output is correct
11 Correct 36 ms 5444 KB Output is correct
12 Correct 38 ms 5612 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 1 ms 336 KB Output is correct
21 Correct 1 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 2 ms 828 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 3 ms 1360 KB Output is correct
30 Correct 1 ms 1088 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 47 ms 5804 KB Output is correct
36 Correct 11 ms 2768 KB Output is correct
37 Correct 52 ms 5512 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 5576 KB Output is correct
41 Correct 38 ms 5832 KB Output is correct
42 Correct 36 ms 5460 KB Output is correct
43 Correct 36 ms 5556 KB Output is correct
44 Correct 0 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 1104 KB Output is correct
50 Correct 1 ms 480 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 1376 KB Output is correct
56 Correct 1 ms 1104 KB Output is correct
57 Correct 4 ms 1952 KB Output is correct
58 Correct 16 ms 3652 KB Output is correct
59 Correct 18 ms 4460 KB Output is correct
60 Correct 267 ms 6536 KB Output is correct
61 Correct 35 ms 4448 KB Output is correct
62 Correct 38 ms 4948 KB Output is correct
63 Correct 198 ms 6604 KB Output is correct
64 Correct 29 ms 4576 KB Output is correct
65 Correct 226 ms 6588 KB Output is correct
66 Correct 44 ms 5352 KB Output is correct
67 Correct 125 ms 5948 KB Output is correct
68 Correct 44 ms 4648 KB Output is correct
69 Correct 0 ms 336 KB Output is correct