oj.uz

Submission #145795

# Submission time Handle Problem Language Result Execution time Memory
145795 2019-08-21T06:58:43 Z letrongdat Cop and Robber (BOI14_coprobber) C++17
100 / 100
 861 ms 9588 KB 
#include "coprobber.h"
#include <bits/stdc++.h>
const int maxN = 500;
using namespace std;
#define forn(i, a, b)   for(int i=a; i<=b; ++i)
#define repn(i, a, b)   for(int i=a; i <b; ++i)

int cur;
int mov[maxN][maxN], deg[maxN][maxN];
int W[maxN][maxN][2];
int start(int N, bool A[maxN][maxN]) {
    queue < tuple < int, int, int > > q;
    repn(i, 0, N) repn(j, 0, N) repn(k, 0, N) deg[i][j] += A[j][k];
    repn(i, 0, N) forn(turn, 0, 1) {
        W[i][i][turn] = 1;
        q.push({i, i, turn});
    }
    while (q.size()) {
        int c, r, t;
        tie(c, r, t) = q.front();
        q.pop();
        repn(i, 0, N) {
            if (t) {
                if ( (A[c][i] || i == c) && !W[i][r][0]) {
                    mov[i][r] = c;
                    W[i][r][0] = true;
                    q.push({i, r, 0});
                }
                continue;
            }
            if (A[r][i] && !W[c][i][1] && --deg[c][i] < 1) {
                W[c][i][1] = true;
                q.push({c, i, 1});
            }
        }
    }
    repn(i, 0 ,N) {
        int ok = 1;
        repn(j, 0, N) ok &= W[i][j][0];
        if (ok) return cur = i;
    }
    return -1;
}
int nextMove(int R) {
    return cur = mov[cur][R];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 419 ms 7140 KB Output is correct
5 Correct 61 ms 3320 KB Output is correct
6 Correct 455 ms 7288 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 464 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 412 ms 6952 KB Output is correct
4 Correct 423 ms 7136 KB Output is correct
5 Correct 403 ms 6940 KB Output is correct
6 Correct 423 ms 6904 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 419 ms 7140 KB Output is correct
5 Correct 61 ms 3320 KB Output is correct
6 Correct 455 ms 7288 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 2 ms 508 KB Output is correct
9 Correct 412 ms 6952 KB Output is correct
10 Correct 423 ms 7136 KB Output is correct
11 Correct 403 ms 6940 KB Output is correct
12 Correct 423 ms 6904 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 2 ms 504 KB Output is correct
22 Correct 4 ms 1144 KB Output is correct
23 Correct 7 ms 1272 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 4 ms 1016 KB Output is correct
26 Correct 7 ms 1272 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 4 ms 888 KB Output is correct
29 Correct 11 ms 1528 KB Output is correct
30 Correct 4 ms 1144 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 504 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 419 ms 7148 KB Output is correct
36 Correct 60 ms 3192 KB Output is correct
37 Correct 460 ms 7444 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 508 KB Output is correct
40 Correct 414 ms 7072 KB Output is correct
41 Correct 417 ms 7248 KB Output is correct
42 Correct 401 ms 6996 KB Output is correct
43 Correct 423 ms 7036 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 3 ms 504 KB Output is correct
48 Correct 5 ms 1148 KB Output is correct
49 Correct 6 ms 1272 KB Output is correct
50 Correct 2 ms 632 KB Output is correct
51 Correct 4 ms 892 KB Output is correct
52 Correct 6 ms 1144 KB Output is correct
53 Correct 4 ms 888 KB Output is correct
54 Correct 4 ms 888 KB Output is correct
55 Correct 11 ms 1528 KB Output is correct
56 Correct 4 ms 1144 KB Output is correct
57 Correct 13 ms 2048 KB Output is correct
58 Correct 62 ms 3960 KB Output is correct
59 Correct 114 ms 5048 KB Output is correct
60 Correct 795 ms 9528 KB Output is correct
61 Correct 156 ms 5368 KB Output is correct
62 Correct 173 ms 5872 KB Output is correct
63 Correct 798 ms 8580 KB Output is correct
64 Correct 194 ms 5560 KB Output is correct
65 Correct 861 ms 9588 KB Output is correct
66 Correct 450 ms 7376 KB Output is correct
67 Correct 804 ms 8336 KB Output is correct
68 Correct 365 ms 5452 KB Output is correct
69 Correct 2 ms 376 KB Output is correct