oj.uz

Submission #233912

# Submission time Handle Problem Language Result Execution time Memory
233912 2020-05-22T11:02:59 Z parsa_mobed Cop and Robber (BOI14_coprobber) C++14
100 / 100
 586 ms 7820 KB 
#include <bits/stdc++.h>
#include "coprobber.h"

using namespace std;
#define pii pair <int , int>
#define F first
#define S second
#define num(i, j) i * n + j
int deg[MAX_N], Win[MAX_N][MAX_N][2], Cnt[MAX_N][MAX_N], Par[MAX_N][MAX_N], curPos;

int start(int n, bool A[MAX_N][MAX_N]) {
    for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) if (A[i][j]) deg[i]++;
    for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) Cnt[i][j] = deg[j];
    queue <pii> q;
    for (int i = 0; i < n; i++) for (int t = 0; t < 2; t++) q.push({num(i, i), t}), Win[i][i][t] = 1, Par[i][i] = i;
    while (!q.empty()) {
        pii p = q.front(); q.pop();
        int cop = p.F / n, rob = p.F % n;
        if (p.S == 0) {
            // Robber turn
            for (int u = 0; u < n; u++)
                if ((u == cop || A[u][cop]) && !Win[u][rob][1])
                    Win[u][rob][1] = 1, Par[u][rob] = cop, q.push({num(u, rob), 1});
        } else {
            // Cop turn
            for (int u = 0; u < n; u++) if (A[u][rob]) {
                Cnt[cop][u]--;
                if (Cnt[cop][u] == 0 && !Win[cop][u][0]) Win[cop][u][0] = 1, q.push({num(cop, u), 0});
            }
        }
    }
    for (int i = 0; i < n; i++) {
        bool Can = 1;
        for (int j = 0; j < n; j++) Can &= Win[i][j][1];
        if (Can) return curPos = i;
    }
    return -1;
}

int nextMove(int robber) {
    return curPos = Par[curPos][robber];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 351 ms 5752 KB Output is correct
5 Correct 56 ms 2936 KB Output is correct
6 Correct 413 ms 5708 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 353 ms 5880 KB Output is correct
4 Correct 353 ms 5752 KB Output is correct
5 Correct 338 ms 5624 KB Output is correct
6 Correct 375 ms 5732 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 1152 KB Output is correct
11 Correct 7 ms 1280 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 5 ms 896 KB Output is correct
14 Correct 8 ms 1152 KB Output is correct
15 Correct 6 ms 896 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 12 ms 1408 KB Output is correct
18 Correct 6 ms 1152 KB Output is correct
19 Correct 5 ms 384 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 351 ms 5752 KB Output is correct
5 Correct 56 ms 2936 KB Output is correct
6 Correct 413 ms 5708 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 353 ms 5880 KB Output is correct
10 Correct 353 ms 5752 KB Output is correct
11 Correct 338 ms 5624 KB Output is correct
12 Correct 375 ms 5732 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 512 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 6 ms 1152 KB Output is correct
23 Correct 7 ms 1280 KB Output is correct
24 Correct 5 ms 640 KB Output is correct
25 Correct 5 ms 896 KB Output is correct
26 Correct 8 ms 1152 KB Output is correct
27 Correct 6 ms 896 KB Output is correct
28 Correct 6 ms 896 KB Output is correct
29 Correct 12 ms 1408 KB Output is correct
30 Correct 6 ms 1152 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Correct 4 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 364 ms 5752 KB Output is correct
36 Correct 56 ms 2936 KB Output is correct
37 Correct 397 ms 5752 KB Output is correct
38 Correct 4 ms 384 KB Output is correct
39 Correct 5 ms 512 KB Output is correct
40 Correct 367 ms 5624 KB Output is correct
41 Correct 385 ms 5752 KB Output is correct
42 Correct 330 ms 5708 KB Output is correct
43 Correct 385 ms 5600 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 5 ms 384 KB Output is correct
46 Correct 5 ms 416 KB Output is correct
47 Correct 5 ms 512 KB Output is correct
48 Correct 6 ms 1152 KB Output is correct
49 Correct 7 ms 1152 KB Output is correct
50 Correct 5 ms 640 KB Output is correct
51 Correct 6 ms 1024 KB Output is correct
52 Correct 7 ms 1152 KB Output is correct
53 Correct 6 ms 896 KB Output is correct
54 Correct 6 ms 896 KB Output is correct
55 Correct 12 ms 1408 KB Output is correct
56 Correct 6 ms 1152 KB Output is correct
57 Correct 10 ms 2048 KB Output is correct
58 Correct 27 ms 3712 KB Output is correct
59 Correct 35 ms 4472 KB Output is correct
60 Correct 446 ms 7820 KB Output is correct
61 Correct 85 ms 4820 KB Output is correct
62 Correct 80 ms 5112 KB Output is correct
63 Correct 493 ms 6916 KB Output is correct
64 Correct 107 ms 4856 KB Output is correct
65 Correct 552 ms 7568 KB Output is correct
66 Correct 374 ms 5756 KB Output is correct
67 Correct 586 ms 6836 KB Output is correct
68 Correct 245 ms 4736 KB Output is correct
69 Correct 4 ms 384 KB Output is correct