oj.uz

Submission #160388

# Submission time Handle Problem Language Result Execution time Memory
160388 2019-10-27T08:43:04 Z PeppaPig Cop and Robber (BOI14_coprobber) C++14
100 / 100
 1281 ms 8184 KB 
#include "coprobber.h"
#include <bits/stdc++.h>

#define iii tuple<int, int, int>

using namespace std;

const int N = 505;

int n, ret;
int par[N][N], cnt[N][N], adj[N]; //0 - cop turn, 1 - robber turn
bool chk[2][N][N];
queue<iii> Q;

int start(int _n, bool A[MAX_N][MAX_N]) {
    n = _n;
    memset(par, -1, sizeof par);
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) adj[i] += A[i][j];
        Q.emplace(0, i, i), Q.emplace(1, i, i);
        chk[0][i][i] = chk[1][i][i] = true;
    }
    while(!Q.empty()) {
        iii now = Q.front(); Q.pop();
        int T, cop, rob;
        tie(T, cop, rob) = now;

        if(T == 0) {
            for(int i = 0; i < n; i++) if(A[rob][i] && !chk[1][cop][i]) {
                ++cnt[cop][i];
                if(cnt[cop][i] == adj[i]) {
                    chk[1][cop][i] = true;
                    Q.emplace(1, cop, i);
                }
            }
        } else {
            for(int i = 0; i < n; i++) if((A[cop][i] || i == cop) && !chk[0][i][rob]) {
                chk[0][i][rob] = true;
                par[i][rob] = cop;
                Q.emplace(0, i, rob);
            }
        }
    }
    for(int i = 0; i < n; i++) {
        bool valid = true;
        for(int j = 0; j < n; j++) if(i != j && par[i][j] == -1) valid = false;
        if(valid) return ret = i;
    }
    return -1;
}

int nextMove(int R) {
    return ret = par[ret][R];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1400 KB Output is correct
3 Correct 3 ms 1400 KB Output is correct
4 Correct 764 ms 5752 KB Output is correct
5 Correct 96 ms 3192 KB Output is correct
6 Correct 803 ms 5864 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1400 KB Output is correct
3 Correct 745 ms 5748 KB Output is correct
4 Correct 827 ms 5752 KB Output is correct
5 Correct 705 ms 5564 KB Output is correct
6 Correct 764 ms 5496 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1400 KB Output is correct
3 Correct 3 ms 1400 KB Output is correct
4 Correct 3 ms 1392 KB Output is correct
5 Correct 3 ms 1400 KB Output is correct
6 Correct 3 ms 1400 KB Output is correct
7 Correct 3 ms 1336 KB Output is correct
8 Correct 3 ms 1400 KB Output is correct
9 Correct 7 ms 1400 KB Output is correct
10 Correct 4 ms 1656 KB Output is correct
11 Correct 7 ms 1784 KB Output is correct
12 Correct 3 ms 1400 KB Output is correct
13 Correct 4 ms 1528 KB Output is correct
14 Correct 8 ms 1660 KB Output is correct
15 Correct 5 ms 1656 KB Output is correct
16 Correct 6 ms 1656 KB Output is correct
17 Correct 15 ms 2040 KB Output is correct
18 Correct 4 ms 1656 KB Output is correct
19 Correct 3 ms 1400 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1400 KB Output is correct
3 Correct 3 ms 1400 KB Output is correct
4 Correct 764 ms 5752 KB Output is correct
5 Correct 96 ms 3192 KB Output is correct
6 Correct 803 ms 5864 KB Output is correct
7 Correct 3 ms 1528 KB Output is correct
8 Correct 3 ms 1400 KB Output is correct
9 Correct 745 ms 5748 KB Output is correct
10 Correct 827 ms 5752 KB Output is correct
11 Correct 705 ms 5564 KB Output is correct
12 Correct 764 ms 5496 KB Output is correct
13 Correct 3 ms 1528 KB Output is correct
14 Correct 3 ms 1400 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 3 ms 1392 KB Output is correct
17 Correct 3 ms 1400 KB Output is correct
18 Correct 3 ms 1400 KB Output is correct
19 Correct 3 ms 1336 KB Output is correct
20 Correct 3 ms 1400 KB Output is correct
21 Correct 7 ms 1400 KB Output is correct
22 Correct 4 ms 1656 KB Output is correct
23 Correct 7 ms 1784 KB Output is correct
24 Correct 3 ms 1400 KB Output is correct
25 Correct 4 ms 1528 KB Output is correct
26 Correct 8 ms 1660 KB Output is correct
27 Correct 5 ms 1656 KB Output is correct
28 Correct 6 ms 1656 KB Output is correct
29 Correct 15 ms 2040 KB Output is correct
30 Correct 4 ms 1656 KB Output is correct
31 Correct 3 ms 1400 KB Output is correct
32 Correct 3 ms 1272 KB Output is correct
33 Correct 3 ms 1400 KB Output is correct
34 Correct 3 ms 1400 KB Output is correct
35 Correct 838 ms 5764 KB Output is correct
36 Correct 96 ms 3192 KB Output is correct
37 Correct 801 ms 5920 KB Output is correct
38 Correct 3 ms 1400 KB Output is correct
39 Correct 3 ms 1400 KB Output is correct
40 Correct 892 ms 5852 KB Output is correct
41 Correct 761 ms 5756 KB Output is correct
42 Correct 710 ms 5700 KB Output is correct
43 Correct 766 ms 5496 KB Output is correct
44 Correct 3 ms 1400 KB Output is correct
45 Correct 3 ms 1400 KB Output is correct
46 Correct 3 ms 1400 KB Output is correct
47 Correct 3 ms 1400 KB Output is correct
48 Correct 4 ms 1656 KB Output is correct
49 Correct 7 ms 1784 KB Output is correct
50 Correct 3 ms 1400 KB Output is correct
51 Correct 4 ms 1656 KB Output is correct
52 Correct 8 ms 1784 KB Output is correct
53 Correct 5 ms 1648 KB Output is correct
54 Correct 5 ms 1692 KB Output is correct
55 Correct 15 ms 2020 KB Output is correct
56 Correct 4 ms 1656 KB Output is correct
57 Correct 8 ms 2168 KB Output is correct
58 Correct 22 ms 3076 KB Output is correct
59 Correct 37 ms 3576 KB Output is correct
60 Correct 1281 ms 8184 KB Output is correct
61 Correct 178 ms 4344 KB Output is correct
62 Correct 169 ms 4472 KB Output is correct
63 Correct 1086 ms 7404 KB Output is correct
64 Correct 187 ms 4220 KB Output is correct
65 Correct 1129 ms 8068 KB Output is correct
66 Correct 736 ms 6048 KB Output is correct
67 Correct 980 ms 7016 KB Output is correct
68 Correct 591 ms 3960 KB Output is correct
69 Correct 3 ms 1400 KB Output is correct