Submission #234103

# Submission time Handle Problem Language Result Execution time Memory
234103 2020-05-23T06:12:37 Z AM1648 Cop and Robber (BOI14_coprobber) C++17
100 / 100
683 ms 10744 KB
/* be name khoda */

// #define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <fstream>
#include <set>
#include <map>

using namespace std;

#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif

typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;

#define forifrom(i, s, n) for (ll i = s; i < n; ++i)
#define forirto(i, n, e) for (ll i = (n) - 1; i >= e; --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)

#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))

#define debug(x) cout << #x << " -> " << (x) << endl
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl
#define debugp(x) cout << #x << " -> " << "(" << (x).F << ", " << (x).S << ")" << endl
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugap(x, n) cout << #x << " ->\n"; fori (i1_dap, n) { cout << "(" << (x)[i1_dap].F << ", " << (x)[i1_dap].S << ")\n"; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl
#define debugav(x, n) cout << #x << " ->\n"; fori (i1_dav, n) { fori (i2_dav, (x)[i1_dav].size()) { cout << (x)[i1_dav][i2_dav] << ' '; } cout << '\n'; } cout << endl
#define debugia(x, n) cout << #x << " ->\n"; fori (i1_dia, n) { cout << i1_dia << " : " << (x)[i1_dia] << '\n'; } cout << endl

const ll MOD = 1000000007;
const ll INF = 2000000000;
const long long BIG = 1446803456761533460LL;

#define Add(a, b) a = ((a) + (b)) % MOD
#define Mul(a, b) a = (1LL * (a) * (b)) % MOD

// -----------------------------------------------------------------------

const ll MAX_N = 500;
const ll maxn = 500;
const ll maxnlg = 20;

struct State {
    ll u, v, b;
};

// 0 -> robbers' turn, 1 -> cop's turn
ll C;
ll par[maxn][maxn][2];
ll deg[maxn][maxn];
State q[maxn * maxn * 2];

ll start(ll n, bool G[MAX_N][MAX_N]) {
    ll l = 0, r = 0;
    memset(par, -1, sizeof par);
    fori (i, n) {
        q[r++] = {i, i, 0};
        q[r++] = {i, i, 1};
        par[i][i][0] = par[i][i][1] = 0;
    }
    fori (i, n) {
        ll d = 0;
        fori (j, n) d += G[i][j];
        fill (deg[i], deg[i] + n, d);
    }
    while (l < r) {
        State x = q[l++];
        if (!x.b) {
            fori (i, n) {
                if (par[x.u][i][1] == -1 && (G[x.v][i] || i == x.v)) {
                    par[x.u][i][1] = x.v;
                    q[r++] = {x.u, i, 1};
                }
            }
        } else {
            fori (i, n) {
                if (par[i][x.v][0] == -1 && G[x.u][i] && --deg[i][x.v] == 0) {
                    par[i][x.v][0] = x.u;
                    q[r++] = {i, x.v, 0};
                }
            }
        }
    }
    fori (i, n) {
        bool flag = true;
        fori (j, n) {
            if (par[j][i][1] == -1) {
                flag = false;
                break;
            }
        }
        if (flag) return i;
    }
    return -1;
}

ll nextMove(ll R) {
    C = par[R][C][1];
    return C;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 2304 KB Output is correct
2 Correct 5 ms 2304 KB Output is correct
3 Correct 5 ms 2304 KB Output is correct
4 Correct 393 ms 10616 KB Output is correct
5 Correct 85 ms 4728 KB Output is correct
6 Correct 682 ms 10624 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 2304 KB Output is correct
2 Correct 6 ms 2304 KB Output is correct
3 Correct 499 ms 10428 KB Output is correct
4 Correct 394 ms 10744 KB Output is correct
5 Correct 490 ms 9976 KB Output is correct
6 Correct 439 ms 10488 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 2304 KB Output is correct
2 Correct 5 ms 2304 KB Output is correct
3 Correct 5 ms 2304 KB Output is correct
4 Correct 5 ms 2304 KB Output is correct
5 Correct 5 ms 2304 KB Output is correct
6 Correct 5 ms 2304 KB Output is correct
7 Correct 7 ms 2432 KB Output is correct
8 Correct 5 ms 2304 KB Output is correct
9 Correct 6 ms 2432 KB Output is correct
10 Correct 7 ms 2560 KB Output is correct
11 Correct 8 ms 2560 KB Output is correct
12 Correct 6 ms 2432 KB Output is correct
13 Correct 7 ms 2560 KB Output is correct
14 Correct 9 ms 2560 KB Output is correct
15 Correct 7 ms 2560 KB Output is correct
16 Correct 7 ms 2608 KB Output is correct
17 Correct 12 ms 2944 KB Output is correct
18 Correct 7 ms 2560 KB Output is correct
19 Correct 5 ms 2304 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 2304 KB Output is correct
2 Correct 5 ms 2304 KB Output is correct
3 Correct 5 ms 2304 KB Output is correct
4 Correct 393 ms 10616 KB Output is correct
5 Correct 85 ms 4728 KB Output is correct
6 Correct 682 ms 10624 KB Output is correct
7 Correct 6 ms 2304 KB Output is correct
8 Correct 6 ms 2304 KB Output is correct
9 Correct 499 ms 10428 KB Output is correct
10 Correct 394 ms 10744 KB Output is correct
11 Correct 490 ms 9976 KB Output is correct
12 Correct 439 ms 10488 KB Output is correct
13 Correct 6 ms 2304 KB Output is correct
14 Correct 5 ms 2304 KB Output is correct
15 Correct 5 ms 2304 KB Output is correct
16 Correct 5 ms 2304 KB Output is correct
17 Correct 5 ms 2304 KB Output is correct
18 Correct 5 ms 2304 KB Output is correct
19 Correct 7 ms 2432 KB Output is correct
20 Correct 5 ms 2304 KB Output is correct
21 Correct 6 ms 2432 KB Output is correct
22 Correct 7 ms 2560 KB Output is correct
23 Correct 8 ms 2560 KB Output is correct
24 Correct 6 ms 2432 KB Output is correct
25 Correct 7 ms 2560 KB Output is correct
26 Correct 9 ms 2560 KB Output is correct
27 Correct 7 ms 2560 KB Output is correct
28 Correct 7 ms 2608 KB Output is correct
29 Correct 12 ms 2944 KB Output is correct
30 Correct 7 ms 2560 KB Output is correct
31 Correct 5 ms 2304 KB Output is correct
32 Correct 5 ms 2304 KB Output is correct
33 Correct 5 ms 2304 KB Output is correct
34 Correct 5 ms 2304 KB Output is correct
35 Correct 399 ms 10652 KB Output is correct
36 Correct 84 ms 4728 KB Output is correct
37 Correct 683 ms 10336 KB Output is correct
38 Correct 6 ms 2304 KB Output is correct
39 Correct 5 ms 2304 KB Output is correct
40 Correct 477 ms 10348 KB Output is correct
41 Correct 402 ms 10616 KB Output is correct
42 Correct 494 ms 9976 KB Output is correct
43 Correct 437 ms 10452 KB Output is correct
44 Correct 5 ms 2304 KB Output is correct
45 Correct 5 ms 2304 KB Output is correct
46 Correct 5 ms 2304 KB Output is correct
47 Correct 6 ms 2304 KB Output is correct
48 Correct 7 ms 2560 KB Output is correct
49 Correct 8 ms 2560 KB Output is correct
50 Correct 6 ms 2432 KB Output is correct
51 Correct 7 ms 2560 KB Output is correct
52 Correct 9 ms 2688 KB Output is correct
53 Correct 7 ms 2560 KB Output is correct
54 Correct 7 ms 2560 KB Output is correct
55 Correct 12 ms 2944 KB Output is correct
56 Correct 7 ms 2560 KB Output is correct
57 Correct 10 ms 2816 KB Output is correct
58 Correct 24 ms 3320 KB Output is correct
59 Correct 36 ms 3576 KB Output is correct
60 Correct 383 ms 10364 KB Output is correct
61 Correct 116 ms 4352 KB Output is correct
62 Correct 120 ms 4344 KB Output is correct
63 Correct 608 ms 10616 KB Output is correct
64 Correct 140 ms 4728 KB Output is correct
65 Correct 475 ms 10372 KB Output is correct
66 Correct 598 ms 9940 KB Output is correct
67 Correct 520 ms 10360 KB Output is correct
68 Correct 426 ms 6164 KB Output is correct
69 Correct 5 ms 2304 KB Output is correct