oj.uz

답안 #379576

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
379576 2021-03-18T16:13:50 Z Kubin 경찰관과 강도 (BOI14_coprobber) C++17
100 / 100
 908 ms 7404 KB 
#include <bits/stdc++.h>

using namespace std;

const size_t M = 512;

int n;
bool G[M][M];
bool vis[2][M][M], win[2][M][M], lose[2][M][M];
int opt[2][M][M], deg[2][M][M], gdeg[M], vertex;

void dfs(bool t, int u, int v)
{
    vis[t][u][v] = true;
    if(t) // robber
    {
        for(int u1 = 0; u1 < n; u1++) if((u1 == u or G[u1][u]) and not vis[0][u1][v])
        {
            if(lose[1][u][v])
                win[0][u1][v] = true, opt[0][u1][v] = u;
            else if(--deg[0][u1][v] == 0)
                lose[0][u1][v] = true;
            else
                continue;
            dfs(0, u1, v);
        }
    }
    else // cop
    {
        for(int v1 = 0; v1 < n; v1++) if(G[v1][v] and not vis[1][u][v1])
        {
            if(lose[0][u][v])
                win[1][u][v1] = true, opt[1][u][v1] = v;
            else if(--deg[1][u][v1] == 0)
                lose[1][u][v1] = true;
            else
                continue;
            dfs(1, u, v1);
        }
    }
}

int start(int _n, bool _G[500][500])
{
    n = _n;
    for(int u = 0; u < n; u++)
        for(int v = 0; v < n; v++)
            G[u][v] = _G[u][v], opt[0][u][v] = opt[1][u][v] = -1;

    for(int u = 0; u < n; u++)
        for(int v = 0; v < n; v++)
            gdeg[u] += G[u][v];
    for(int u = 0; u < n; u++)
        for(int v = 0; v < n; v++)
            deg[0][u][v] = gdeg[u] + 1, deg[1][u][v] = gdeg[v];

    for(int u = 0; u < n; u++)
        win[0][u][u] = lose[1][u][u] = true;

    for(int u = 0; u < n; u++)
        if(not vis[1][u][u])
            dfs(1, u, u);

    for(int u = 0; u < n; u++)
    {
        bool all = true;
        for(int v = 0; v < n; v++)
            if(not win[0][u][v])
                all = false;
        if(all)
            return vertex = u;
    }
    return -1;
}

int nextMove(int r)
{
    return vertex = opt[0][vertex][r];
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 431 ms 7404 KB Output is correct
5 Correct 58 ms 3564 KB Output is correct
6 Correct 499 ms 6892 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 489 ms 7148 KB Output is correct
4 Correct 452 ms 7384 KB Output is correct
5 Correct 415 ms 7020 KB Output is correct
6 Correct 559 ms 7148 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 2 ms 1516 KB Output is correct
11 Correct 4 ms 1516 KB Output is correct
12 Correct 1 ms 748 KB Output is correct
13 Correct 2 ms 1388 KB Output is correct
14 Correct 5 ms 1516 KB Output is correct
15 Correct 2 ms 1004 KB Output is correct
16 Correct 4 ms 1004 KB Output is correct
17 Correct 10 ms 1772 KB Output is correct
18 Correct 2 ms 1516 KB Output is correct
19 Correct 1 ms 364 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 431 ms 7404 KB Output is correct
5 Correct 58 ms 3564 KB Output is correct
6 Correct 499 ms 6892 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 489 ms 7148 KB Output is correct
10 Correct 452 ms 7384 KB Output is correct
11 Correct 415 ms 7020 KB Output is correct
12 Correct 559 ms 7148 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 620 KB Output is correct
22 Correct 2 ms 1516 KB Output is correct
23 Correct 4 ms 1516 KB Output is correct
24 Correct 1 ms 748 KB Output is correct
25 Correct 2 ms 1388 KB Output is correct
26 Correct 5 ms 1516 KB Output is correct
27 Correct 2 ms 1004 KB Output is correct
28 Correct 4 ms 1004 KB Output is correct
29 Correct 10 ms 1772 KB Output is correct
30 Correct 2 ms 1516 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 463 ms 7276 KB Output is correct
36 Correct 58 ms 3516 KB Output is correct
37 Correct 500 ms 7020 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 1 ms 492 KB Output is correct
40 Correct 427 ms 7088 KB Output is correct
41 Correct 437 ms 7280 KB Output is correct
42 Correct 418 ms 6968 KB Output is correct
43 Correct 445 ms 7148 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 492 KB Output is correct
46 Correct 1 ms 492 KB Output is correct
47 Correct 1 ms 620 KB Output is correct
48 Correct 2 ms 1516 KB Output is correct
49 Correct 4 ms 1516 KB Output is correct
50 Correct 1 ms 748 KB Output is correct
51 Correct 2 ms 1260 KB Output is correct
52 Correct 5 ms 1516 KB Output is correct
53 Correct 2 ms 1004 KB Output is correct
54 Correct 2 ms 1004 KB Output is correct
55 Correct 12 ms 1772 KB Output is correct
56 Correct 2 ms 1516 KB Output is correct
57 Correct 6 ms 2540 KB Output is correct
58 Correct 22 ms 4844 KB Output is correct
59 Correct 34 ms 5868 KB Output is correct
60 Correct 620 ms 7056 KB Output is correct
61 Correct 138 ms 5320 KB Output is correct
62 Correct 134 ms 5868 KB Output is correct
63 Correct 882 ms 7148 KB Output is correct
64 Correct 162 ms 5996 KB Output is correct
65 Correct 908 ms 7276 KB Output is correct
66 Correct 445 ms 6636 KB Output is correct
67 Correct 906 ms 7184 KB Output is correct
68 Correct 357 ms 5996 KB Output is correct
69 Correct 1 ms 364 KB Output is correct