oj.uz

Submission #145799

# Submission time Handle Problem Language Result Execution time Memory
145799 2019-08-21T07:00:04 Z letrongdat Cop and Robber (BOI14_coprobber) C++17
100 / 100
 872 ms 9624 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});
            }
        }
    }
    bool ok = true;
    repn(i, 0, N) ok &= W[0][i][0];
    return (ok ? 0 : -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 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 416 ms 7156 KB Output is correct
5 Correct 60 ms 3192 KB Output is correct
6 Correct 458 ms 7504 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 419 ms 7156 KB Output is correct
4 Correct 417 ms 7168 KB Output is correct
5 Correct 403 ms 6892 KB Output is correct
6 Correct 425 ms 6996 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 1 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 400 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 5 ms 1144 KB Output is correct
11 Correct 6 ms 1272 KB Output is correct
12 Correct 2 ms 652 KB Output is correct
13 Correct 4 ms 1012 KB Output is correct
14 Correct 6 ms 1144 KB Output is correct
15 Correct 4 ms 916 KB Output is correct
16 Correct 4 ms 916 KB Output is correct
17 Correct 12 ms 1496 KB Output is correct
18 Correct 5 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 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 416 ms 7156 KB Output is correct
5 Correct 60 ms 3192 KB Output is correct
6 Correct 458 ms 7504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 419 ms 7156 KB Output is correct
10 Correct 417 ms 7168 KB Output is correct
11 Correct 403 ms 6892 KB Output is correct
12 Correct 425 ms 6996 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 1 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 400 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 504 KB Output is correct
22 Correct 5 ms 1144 KB Output is correct
23 Correct 6 ms 1272 KB Output is correct
24 Correct 2 ms 652 KB Output is correct
25 Correct 4 ms 1012 KB Output is correct
26 Correct 6 ms 1144 KB Output is correct
27 Correct 4 ms 916 KB Output is correct
28 Correct 4 ms 916 KB Output is correct
29 Correct 12 ms 1496 KB Output is correct
30 Correct 5 ms 1144 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 352 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 437 ms 7052 KB Output is correct
36 Correct 69 ms 3196 KB Output is correct
37 Correct 476 ms 7296 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 504 KB Output is correct
40 Correct 416 ms 7132 KB Output is correct
41 Correct 423 ms 7188 KB Output is correct
42 Correct 408 ms 6992 KB Output is correct
43 Correct 424 ms 7004 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 2 ms 528 KB Output is correct
48 Correct 5 ms 1144 KB Output is correct
49 Correct 6 ms 1272 KB Output is correct
50 Correct 3 ms 552 KB Output is correct
51 Correct 4 ms 1016 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 12 ms 1528 KB Output is correct
56 Correct 4 ms 1176 KB Output is correct
57 Correct 13 ms 2040 KB Output is correct
58 Correct 63 ms 3960 KB Output is correct
59 Correct 115 ms 5084 KB Output is correct
60 Correct 808 ms 9624 KB Output is correct
61 Correct 156 ms 5432 KB Output is correct
62 Correct 174 ms 5836 KB Output is correct
63 Correct 790 ms 8524 KB Output is correct
64 Correct 193 ms 5716 KB Output is correct
65 Correct 872 ms 9472 KB Output is correct
66 Correct 453 ms 7164 KB Output is correct
67 Correct 795 ms 8372 KB Output is correct
68 Correct 365 ms 5380 KB Output is correct
69 Correct 2 ms 308 KB Output is correct