oj.uz

Submission #312279

# Submission time Handle Problem Language Result Execution time Memory
312279 2020-10-13T00:48:50 Z aZvezda Cop and Robber (BOI14_coprobber) C++14
100 / 100
 845 ms 10744 KB 
#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
template<class T, class T2> inline ostream &operator <<(ostream &out, const pair<T, T2> &x) { out << x.first << " " << x.second; return out;}
template<class T, class T2> inline istream &operator >>(istream &in, pair<T, T2> &x) { in >> x.first >> x.second; return in;}
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
#define out(x) "{" << (#x) << ": " << x << "} "

bool win[MAX_N][MAX_N][2];
int hist[MAX_N][MAX_N][2];
bool used[MAX_N][MAX_N][2];
vector<int> g[MAX_N];
int n, cnt[MAX_N];
int cntChase[MAX_N][MAX_N][2];
int current;

int start(int N, bool A[MAX_N][MAX_N]) {
    n = N;
    for(int i = 0; i < n; i ++) {
        for(int j = 0; j < n; j ++) {
            if(A[i][j] == 1 || i == j) {
                g[i].push_back(j);
                cnt[i] ++;
            }
        }
    }
    queue<pair<pair<int, int>, int> > q;
    for(int i = 0; i < n; i ++) {
        for(int j = 0; j < n; j ++) {
            cntChase[i][j][0] = cnt[i] - 1;
            cntChase[i][j][1] = cnt[j] - 1;
        }
    }
    for(int i = 0; i < n; i ++) {
        win[i][i][0] = win[i][i][1] = true;
        used[i][i][0] = used[i][i][1] = true;
        q.push({{i, i}, 0});
        q.push({{i, i}, 1});
    }

    while(!q.empty()) {
        auto curr = q.front(); q.pop();
        int a, b, who;
        a = curr.first.first; b = curr.first.second; who = curr.second;
        if(who) {
            for(auto it : g[a]) {
                if(used[it][b][who ^ 1]) {continue;}
                win[it][b][who ^ 1] = true;
                hist[it][b][who ^ 1] = a;
                used[it][b][who ^ 1] = true;
                q.push({{it, b}, who ^ 1});
            }
        } else {
            for(auto it : g[b]) {
                if(used[a][it][who ^ 1] || it == b) {continue;}
                cntChase[a][it][who ^ 1] --; if(cntChase[a][it][who ^ 1] > 0) {continue;}
                win[a][it][who ^ 1] = true;
                used[a][it][who ^ 1] = true;
                q.push({{a, it}, who ^ 1});
            }
        }
    }

    for(int i = 0; i < n; i ++) {
        for(int j = 0; j < n; j ++) {
            if(!win[i][j][0]) {break;}
            if(j == n - 1) {
                return current = i;
            }
        }
    }
    return -1;
}

int nextMove(int R) {
    return current = hist[current][R][0];
}

Subtask #1
16.0 / 16.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 0 ms 384 KB Output is correct
4 Correct 72 ms 6680 KB Output is correct
5 Correct 19 ms 3456 KB Output is correct
6 Correct 83 ms 6904 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 512 KB Output is correct
3 Correct 75 ms 6580 KB Output is correct
4 Correct 73 ms 6776 KB Output is correct
5 Correct 72 ms 6552 KB Output is correct
6 Correct 74 ms 6520 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 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 640 KB Output is correct
10 Correct 2 ms 1408 KB Output is correct
11 Correct 3 ms 1408 KB Output is correct
12 Correct 1 ms 640 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct
14 Correct 3 ms 1408 KB Output is correct
15 Correct 2 ms 1024 KB Output is correct
16 Correct 2 ms 1024 KB Output is correct
17 Correct 7 ms 1664 KB Output is correct
18 Correct 2 ms 1408 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 0 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 72 ms 6680 KB Output is correct
5 Correct 19 ms 3456 KB Output is correct
6 Correct 83 ms 6904 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 512 KB Output is correct
9 Correct 75 ms 6580 KB Output is correct
10 Correct 73 ms 6776 KB Output is correct
11 Correct 72 ms 6552 KB Output is correct
12 Correct 74 ms 6520 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 640 KB Output is correct
22 Correct 2 ms 1408 KB Output is correct
23 Correct 3 ms 1408 KB Output is correct
24 Correct 1 ms 640 KB Output is correct
25 Correct 1 ms 1152 KB Output is correct
26 Correct 3 ms 1408 KB Output is correct
27 Correct 2 ms 1024 KB Output is correct
28 Correct 2 ms 1024 KB Output is correct
29 Correct 7 ms 1664 KB Output is correct
30 Correct 2 ms 1408 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 71 ms 6648 KB Output is correct
36 Correct 19 ms 3456 KB Output is correct
37 Correct 83 ms 6904 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 512 KB Output is correct
40 Correct 77 ms 6580 KB Output is correct
41 Correct 73 ms 6648 KB Output is correct
42 Correct 72 ms 6552 KB Output is correct
43 Correct 83 ms 6584 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 512 KB Output is correct
47 Correct 1 ms 640 KB Output is correct
48 Correct 2 ms 1408 KB Output is correct
49 Correct 3 ms 1408 KB Output is correct
50 Correct 1 ms 640 KB Output is correct
51 Correct 1 ms 1152 KB Output is correct
52 Correct 3 ms 1408 KB Output is correct
53 Correct 2 ms 1024 KB Output is correct
54 Correct 2 ms 1024 KB Output is correct
55 Correct 7 ms 1664 KB Output is correct
56 Correct 2 ms 1408 KB Output is correct
57 Correct 6 ms 2432 KB Output is correct
58 Correct 19 ms 4480 KB Output is correct
59 Correct 29 ms 5504 KB Output is correct
60 Correct 845 ms 10744 KB Output is correct
61 Correct 86 ms 6392 KB Output is correct
62 Correct 74 ms 6784 KB Output is correct
63 Correct 587 ms 9336 KB Output is correct
64 Correct 51 ms 6140 KB Output is correct
65 Correct 650 ms 10396 KB Output is correct
66 Correct 86 ms 7032 KB Output is correct
67 Correct 314 ms 8848 KB Output is correct
68 Correct 99 ms 6136 KB Output is correct
69 Correct 0 ms 384 KB Output is correct