oj.uz

Submission #250558

# Submission time Handle Problem Language Result Execution time Memory
250558 2020-07-18T10:56:18 Z opukittpceno_hhr Cop and Robber (BOI14_coprobber) C++17
100 / 100
 1423 ms 9848 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>
 
#define MAX_N 500

using namespace std;
 
const int M = 500 * 500 * 2;
 
int Nn, C;

int loose[M];
int win[M];
int cnt[M];
int turn[M];
int used[M]; 
int grid[MAX_N][MAX_N];

void dfs(int v) {
    int n = Nn;
    used[v] = 1;
    {
        int k = v;
        int t = k / (n * n);
        int st = k % (n * n);
        int i = st / n;
        int j = st % n;
        if (t == 0) {
            for (int to = 0; to < n; to++) {
                if (grid[to][j]) {
                    int nw = n * n + i * n + to;
                    if (used[nw]) continue;
                    if (loose[v]) {
                        win[nw] = 1;
                        turn[nw] = v;
                        dfs(nw);
                    } else {
                        cnt[nw]--;
                        if (cnt[nw] == 0) {
                            loose[nw] = 1;
                            dfs(nw);
                        }
                    }
                }
            }
        } else {
            for (int to = 0; to < n; to++) {
                if (grid[to][i] || (i == to)) {
                    int nw = to * n + j; 
                    if (used[nw]) continue;
                    if (loose[v]) {
                        win[nw] = 1;
                        turn[nw] = v;
                        dfs(nw);
                    } else {
                        cnt[nw]--;
                        if (cnt[nw] == 0) {
                            loose[nw] = 1;
                            dfs(nw);
                        }
                    }
                }
            }
        }
    }
}
 
int start(int N, bool a[MAX_N][MAX_N]) {
    int n = N;
    Nn = N;
    C = -1;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            grid[i][j] = a[i][j];
        }
    }
    for (int k = 0; k < 2 * n * n; k++) {
        int t = k / (n * n);
        int st = k % (n * n);
        int i = st / n;
        int j = st % n;
        if (t == 0) {
            for (int to = 0; to < n; to++) {
                if (a[i][to] || i == to) {
                    cnt[k]++;
                }
            }
        } else {
            for (int to = 0; to < n; to++) {
                if (a[j][to]) {
                    cnt[k]++;
                }
            }
        }
    }
    for (int i = 0; i < n; i++) {
        loose[n * n + i * n + i] = 1;
    }
    for (int i = 0; i < n; i++) {
        win[i * n + i] = 1;
    }
    for (int i = 0; i < 2 * n * n; i++) {
        if (!used[i] && (win[i] || loose[i])) {
            dfs(i);
        }
    }
    for (int i = 0; i < n; i++) {
        int ok = 1;
        for (int j = 0; j < n; j++) {
            ok &= win[i * n + j];
        }
        if (ok) {
            C = i;
            return i;
        }
    }
    return -1;
}

int nextMove(int r) {
    int next_state = turn[C * Nn + r];
    next_state %= (Nn * Nn);
    C = next_state / Nn;
    return C;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 716 ms 9848 KB Output is correct
5 Correct 91 ms 3064 KB Output is correct
6 Correct 775 ms 9464 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 724 ms 9592 KB Output is correct
4 Correct 725 ms 9804 KB Output is correct
5 Correct 679 ms 9180 KB Output is correct
6 Correct 732 ms 9592 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 716 ms 9848 KB Output is correct
5 Correct 91 ms 3064 KB Output is correct
6 Correct 775 ms 9464 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 724 ms 9592 KB Output is correct
10 Correct 725 ms 9804 KB Output is correct
11 Correct 679 ms 9180 KB Output is correct
12 Correct 732 ms 9592 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 5 ms 896 KB Output is correct
23 Correct 10 ms 896 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 3 ms 640 KB Output is correct
26 Correct 9 ms 896 KB Output is correct
27 Correct 2 ms 640 KB Output is correct
28 Correct 3 ms 640 KB Output is correct
29 Correct 14 ms 1152 KB Output is correct
30 Correct 4 ms 896 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 714 ms 9720 KB Output is correct
36 Correct 97 ms 3064 KB Output is correct
37 Correct 749 ms 9464 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 697 ms 9536 KB Output is correct
41 Correct 725 ms 9752 KB Output is correct
42 Correct 663 ms 9136 KB Output is correct
43 Correct 728 ms 9540 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 0 ms 384 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 5 ms 896 KB Output is correct
49 Correct 10 ms 896 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 3 ms 768 KB Output is correct
52 Correct 9 ms 908 KB Output is correct
53 Correct 2 ms 640 KB Output is correct
54 Correct 3 ms 640 KB Output is correct
55 Correct 15 ms 1152 KB Output is correct
56 Correct 4 ms 896 KB Output is correct
57 Correct 28 ms 1920 KB Output is correct
58 Correct 165 ms 5756 KB Output is correct
59 Correct 340 ms 8432 KB Output is correct
60 Correct 1089 ms 9576 KB Output is correct
61 Correct 768 ms 7160 KB Output is correct
62 Correct 843 ms 8552 KB Output is correct
63 Correct 1067 ms 9680 KB Output is correct
64 Correct 594 ms 8464 KB Output is correct
65 Correct 1365 ms 9592 KB Output is correct
66 Correct 712 ms 8764 KB Output is correct
67 Correct 1423 ms 9724 KB Output is correct
68 Correct 852 ms 8440 KB Output is correct
69 Correct 1 ms 384 KB Output is correct