oj.uz

Submission #208691

# Submission time Handle Problem Language Result Execution time Memory
208691 2020-03-12T02:48:42 Z E869120 Cop and Robber (BOI14_coprobber) C++14
100 / 100
 757 ms 8184 KB 
#include "coprobber.h"
#include <vector>
#include <queue>
#include <tuple>
using namespace std;

int N;
vector<int> X[509];
bool dp1[509][509], dp2[509][509];
int deg[509][509], to[509][509];
queue<tuple<int, int, int>> Q;

int cx = -1;

void police_add(int police, int robber) {
    for (int i : X[police]) {
        if (dp1[i][robber] == true) continue;
        dp1[i][robber] = true;
        to[i][robber] = police;
        Q.push(make_tuple(i, robber, 2));
    }
    if (dp1[police][robber] == false) {
        to[police][robber] = police;
        dp1[police][robber] = true;
        Q.push(make_tuple(police, robber, 2));
    }
}

void robber_add(int police, int robber) {
    for (int i : X[robber]) {
        deg[police][i]++;
        if (deg[police][i] == X[i].size()) {
            dp2[police][i] = true;
            Q.push(make_tuple(police, i, 1));
        }
    }
}

int start(int NN, bool A[MAX_N][MAX_N]) {
    N = NN; int cnt = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (A[i][j] == 1) { X[i].push_back(j); if (i < j) cnt++; }
        }
    }

    for (int i = 0; i < N; i++) {
        Q.push(make_tuple(i, i, 1));
        dp2[i][i] = true;
    }
    while (!Q.empty()) {
        int s1 = get<0>(Q.front()), s2 = get<1>(Q.front()), s3 = get<2>(Q.front()); Q.pop();
        if (s3 == 1) {
            police_add(s1, s2);
        }
        else {
            robber_add(s1, s2);
        }
    }

    for (int i = 0; i < N; i++) {
        bool flag = false;
        for (int j = 0; j < N; j++) {
            if (dp1[i][j] == false) flag = true;
        }
        if (flag == false) cx = i;
    }
    return cx;
}

int nextMove(int R) {
    cx = to[cx][R];
    return cx;
}

Compilation message

coprobber.cpp: In function 'void robber_add(int, int)':
coprobber.cpp:32:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (deg[police][i] == X[i].size()) {
             ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 75 ms 4344 KB Output is correct
5 Correct 22 ms 2296 KB Output is correct
6 Correct 82 ms 4472 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 83 ms 4256 KB Output is correct
4 Correct 76 ms 4216 KB Output is correct
5 Correct 79 ms 4260 KB Output is correct
6 Correct 88 ms 4216 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 6 ms 888 KB Output is correct
11 Correct 7 ms 888 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 6 ms 632 KB Output is correct
14 Correct 6 ms 892 KB Output is correct
15 Correct 5 ms 760 KB Output is correct
16 Correct 6 ms 632 KB Output is correct
17 Correct 10 ms 1144 KB Output is correct
18 Correct 6 ms 888 KB Output is correct
19 Correct 4 ms 248 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 75 ms 4344 KB Output is correct
5 Correct 22 ms 2296 KB Output is correct
6 Correct 82 ms 4472 KB Output is correct
7 Correct 4 ms 376 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 83 ms 4256 KB Output is correct
10 Correct 76 ms 4216 KB Output is correct
11 Correct 79 ms 4260 KB Output is correct
12 Correct 88 ms 4216 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 4 ms 376 KB Output is correct
17 Correct 5 ms 504 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 4 ms 376 KB Output is correct
20 Correct 4 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 6 ms 888 KB Output is correct
23 Correct 7 ms 888 KB Output is correct
24 Correct 5 ms 504 KB Output is correct
25 Correct 6 ms 632 KB Output is correct
26 Correct 6 ms 892 KB Output is correct
27 Correct 5 ms 760 KB Output is correct
28 Correct 6 ms 632 KB Output is correct
29 Correct 10 ms 1144 KB Output is correct
30 Correct 6 ms 888 KB Output is correct
31 Correct 4 ms 248 KB Output is correct
32 Correct 4 ms 248 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 4 ms 376 KB Output is correct
35 Correct 81 ms 4344 KB Output is correct
36 Correct 25 ms 2168 KB Output is correct
37 Correct 81 ms 4412 KB Output is correct
38 Correct 5 ms 248 KB Output is correct
39 Correct 5 ms 376 KB Output is correct
40 Correct 75 ms 4216 KB Output is correct
41 Correct 87 ms 4256 KB Output is correct
42 Correct 73 ms 4180 KB Output is correct
43 Correct 76 ms 4088 KB Output is correct
44 Correct 5 ms 248 KB Output is correct
45 Correct 4 ms 376 KB Output is correct
46 Correct 5 ms 376 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 6 ms 888 KB Output is correct
49 Correct 7 ms 1016 KB Output is correct
50 Correct 5 ms 504 KB Output is correct
51 Correct 6 ms 760 KB Output is correct
52 Correct 7 ms 888 KB Output is correct
53 Correct 6 ms 632 KB Output is correct
54 Correct 6 ms 632 KB Output is correct
55 Correct 10 ms 1144 KB Output is correct
56 Correct 6 ms 888 KB Output is correct
57 Correct 11 ms 1400 KB Output is correct
58 Correct 23 ms 2552 KB Output is correct
59 Correct 36 ms 3064 KB Output is correct
60 Correct 757 ms 8184 KB Output is correct
61 Correct 89 ms 4216 KB Output is correct
62 Correct 79 ms 4344 KB Output is correct
63 Correct 503 ms 6960 KB Output is correct
64 Correct 61 ms 3704 KB Output is correct
65 Correct 562 ms 7964 KB Output is correct
66 Correct 89 ms 4856 KB Output is correct
67 Correct 269 ms 6284 KB Output is correct
68 Correct 91 ms 3576 KB Output is correct
69 Correct 5 ms 248 KB Output is correct