oj.uz

Submission #54994

# Submission time Handle Problem Language Result Execution time Memory
54994 2018-07-05T17:13:05 Z cki86201 Cop and Robber (BOI14_coprobber) C++11
100 / 100
 446 ms 12000 KB 
#include "coprobber.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <bitset>
#include <complex.h>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define szz(x) ((int)(x).size())
#define rep(i, n) for(int i=0;i<n;i++)
#define all(x) (x).begin(), (x).end()
typedef tuple<int, int, int> t3;
typedef pair<ll, ll> pll;
typedef long double ldouble;
typedef pair<double, double> pdd;

int d[2][510][510], nxt[510][510], cnt[510][510];
int deg[510];
vector <t3> V;
int now_p;

int start(int N, bool A[MAX_N][MAX_N])
{
    rep(i, N) rep(j, N) deg[i] += A[i][j];
    rep(i, N) rep(k, 2) V.pb(t3(k, i, i)), d[k][i][i] = 1, nxt[i][i] = -1;
    rep(i,szz(V)) {
        int t, p, r;
        tie(t, p, r) = V[i];
        if(t == 0) {
            rep(j, N) if(A[r][j]) {
                if(d[1][p][j] == 0) {
                    cnt[p][j]++;
                    if(cnt[p][j] == deg[j]) {
                        d[1][p][j] = 1;
                        V.pb(t3(1, p, j));
                    }
                }
            }
        }
        else {
            rep(j, N) if(A[p][j] || j == p) {
                if(d[0][j][r] == 0) {
                    nxt[j][r] = p;
                    d[0][j][r] = 1;
                    V.pb(t3(0, j, r));
                }
            }
        }
    }
    rep(i, N) {
        int ok = 1;
        rep(j, N) if(d[0][i][j] == 0) { ok = 0; break; }
        if(ok) return now_p = i;
    }
    return -1;
}

int nextMove(int R)
{
    return now_p = nxt[now_p][R];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 257 ms 11908 KB Output is correct
5 Correct 40 ms 4464 KB Output is correct
6 Correct 291 ms 11876 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 251 ms 11740 KB Output is correct
4 Correct 252 ms 11872 KB Output is correct
5 Correct 239 ms 11620 KB Output is correct
6 Correct 258 ms 11980 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 253 ms 11876 KB Output is correct
5 Correct 41 ms 4464 KB Output is correct
6 Correct 289 ms 11924 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 253 ms 11748 KB Output is correct
10 Correct 265 ms 11872 KB Output is correct
11 Correct 247 ms 11744 KB Output is correct
12 Correct 266 ms 11972 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 3 ms 1280 KB Output is correct
18 Correct 4 ms 1280 KB Output is correct
19 Correct 2 ms 640 KB Output is correct
20 Correct 3 ms 1024 KB Output is correct
21 Correct 5 ms 1408 KB Output is correct
22 Correct 3 ms 1024 KB Output is correct
23 Correct 3 ms 1024 KB Output is correct
24 Correct 8 ms 1856 KB Output is correct
25 Correct 3 ms 1152 KB Output is correct
26 Correct 7 ms 2048 KB Output is correct
27 Correct 17 ms 3840 KB Output is correct
28 Correct 27 ms 4728 KB Output is correct
29 Correct 429 ms 11876 KB Output is correct
30 Correct 74 ms 5616 KB Output is correct
31 Correct 71 ms 6100 KB Output is correct
32 Correct 388 ms 11788 KB Output is correct
33 Correct 79 ms 6384 KB Output is correct
34 Correct 430 ms 12000 KB Output is correct
35 Correct 275 ms 11684 KB Output is correct
36 Correct 446 ms 11876 KB Output is correct
37 Correct 205 ms 7916 KB Output is correct
38 Correct 2 ms 384 KB Output is correct