oj.uz

Submission #492837

# Submission time Handle Problem Language Result Execution time Memory
492837 2021-12-09T07:59:00 Z Rainbowbunny Cop and Robber (BOI14_coprobber) C++17
100 / 100
 1396 ms 9552 KB 
#include <bits/stdc++.h>
using namespace std;

#define MAX_N 500

int cop;
int need[2][MAX_N][MAX_N], Next[MAX_N][MAX_N];
int dp[2][MAX_N][MAX_N];

int start(int N, bool Adj[MAX_N][MAX_N]) 
{
    for(int i = 0; i < N; i++)
    {
        int degree = 0;
        for(int j = 0; j < N; j++)
        {
            degree += Adj[i][j];
        }
        for(int j = 0; j < N; j++)
        {
            need[0][i][j] = 1;
            need[1][j][i] = degree;
            if(i == j)
            {
                need[0][i][i] = -1;
                need[1][i][i] = -1;
            }
        }
    }
    queue <tuple <int, int, int> > Q;
    for(int i = 0; i < N; i++)
    {
        Q.emplace(0, i, i);
        Q.emplace(1, i, i);
    }
    int cnt = 0;
    while(!Q.empty())
    {
        int p, u, v;
        tie(p, u, v) = Q.front();
        dp[p][u][v] = 1;
        cnt++;
        Q.pop();
        if(p == 0)
        {
            for(int i = 0; i < N; i++)
            {
                if(Adj[v][i])
                {
                    need[1][u][i]--;
                    if(need[1][u][i] == 0)
                    {
                        Q.emplace(1, u, i);
                    }
                }
            }
        }
        else
        {
            for(int i = 0; i < N; i++)
            {
                if(Adj[u][i] or i == u)
                {
                    need[0][i][v]--;
                    if(need[0][i][v] == 0)
                    {
                        Q.emplace(0, i, v);
                        Next[i][v] = u;
                    }
                }
            }
        }
    }
    if(cnt == 2 * N * N)
    {
        return 0;
    }
    else
    {
        return -1;
    }
}

int nextMove(int R) 
{
    return cop = Next[cop][R];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 757 ms 6532 KB Output is correct
5 Correct 95 ms 3276 KB Output is correct
6 Correct 789 ms 6832 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 766 ms 6544 KB Output is correct
4 Correct 743 ms 6544 KB Output is correct
5 Correct 727 ms 6440 KB Output is correct
6 Correct 797 ms 6488 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 0 ms 328 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 2 ms 1352 KB Output is correct
11 Correct 4 ms 1352 KB Output is correct
12 Correct 1 ms 584 KB Output is correct
13 Correct 2 ms 1096 KB Output is correct
14 Correct 5 ms 1368 KB Output is correct
15 Correct 2 ms 840 KB Output is correct
16 Correct 2 ms 840 KB Output is correct
17 Correct 13 ms 1604 KB Output is correct
18 Correct 2 ms 1352 KB Output is correct
19 Correct 0 ms 328 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 288 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 757 ms 6532 KB Output is correct
5 Correct 95 ms 3276 KB Output is correct
6 Correct 789 ms 6832 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 766 ms 6544 KB Output is correct
10 Correct 743 ms 6544 KB Output is correct
11 Correct 727 ms 6440 KB Output is correct
12 Correct 797 ms 6488 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 0 ms 328 KB Output is correct
17 Correct 1 ms 456 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 0 ms 328 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 1 ms 456 KB Output is correct
22 Correct 2 ms 1352 KB Output is correct
23 Correct 4 ms 1352 KB Output is correct
24 Correct 1 ms 584 KB Output is correct
25 Correct 2 ms 1096 KB Output is correct
26 Correct 5 ms 1368 KB Output is correct
27 Correct 2 ms 840 KB Output is correct
28 Correct 2 ms 840 KB Output is correct
29 Correct 13 ms 1604 KB Output is correct
30 Correct 2 ms 1352 KB Output is correct
31 Correct 0 ms 328 KB Output is correct
32 Correct 0 ms 328 KB Output is correct
33 Correct 0 ms 328 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 776 ms 6532 KB Output is correct
36 Correct 95 ms 3280 KB Output is correct
37 Correct 805 ms 6808 KB Output is correct
38 Correct 0 ms 328 KB Output is correct
39 Correct 1 ms 456 KB Output is correct
40 Correct 759 ms 6524 KB Output is correct
41 Correct 808 ms 6540 KB Output is correct
42 Correct 732 ms 6592 KB Output is correct
43 Correct 779 ms 6536 KB Output is correct
44 Correct 0 ms 328 KB Output is correct
45 Correct 0 ms 328 KB Output is correct
46 Correct 0 ms 328 KB Output is correct
47 Correct 0 ms 456 KB Output is correct
48 Correct 2 ms 1352 KB Output is correct
49 Correct 5 ms 1408 KB Output is correct
50 Correct 0 ms 584 KB Output is correct
51 Correct 2 ms 1096 KB Output is correct
52 Correct 5 ms 1352 KB Output is correct
53 Correct 2 ms 840 KB Output is correct
54 Correct 2 ms 840 KB Output is correct
55 Correct 13 ms 1608 KB Output is correct
56 Correct 2 ms 1352 KB Output is correct
57 Correct 6 ms 2364 KB Output is correct
58 Correct 18 ms 4420 KB Output is correct
59 Correct 28 ms 5404 KB Output is correct
60 Correct 1396 ms 9552 KB Output is correct
61 Correct 158 ms 5908 KB Output is correct
62 Correct 170 ms 6224 KB Output is correct
63 Correct 1193 ms 8408 KB Output is correct
64 Correct 200 ms 5972 KB Output is correct
65 Correct 1206 ms 9416 KB Output is correct
66 Correct 685 ms 7156 KB Output is correct
67 Correct 1018 ms 8240 KB Output is correct
68 Correct 449 ms 5908 KB Output is correct
69 Correct 0 ms 328 KB Output is correct