oj.uz

Submission #91642

# Submission time Handle Problem Language Result Execution time Memory
91642 2018-12-28T23:35:57 Z chpipis Cop and Robber (BOI14_coprobber) C++11
100 / 100
 1230 ms 8436 KB 
#include "coprobber.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define mp make_pair
#define fi first
#define se second

typedef pair<int, int> ii;

bool mat[MAX_N + 5][MAX_N + 5];
bool win[MAX_N + 5][MAX_N + 5][2];
int deg[MAX_N + 5][MAX_N + 5][2];
int mv[MAX_N + 5][MAX_N + 5];
int n;

int last_pos;

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++)
            mat[i][j] = A[i][j];
    memset(win, false, sizeof win);
    queue<pair<ii, int> > q;
    for (int i = 0; i < n; i++) {
        win[i][i][0] = win[i][i][1] = true;
        q.push(mp(mp(i, i), 0));
        q.push(mp(mp(i, i), 1));
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            deg[i][j][0] = 0;
            for (int nxt = 0; nxt < n; nxt++) {
                if (mat[i][nxt])
                    deg[i][j][0]++;
            }
            deg[i][j][1] = 1;
            for (int nxt = 0; nxt < n; nxt++) {
                if (mat[j][nxt])
                    deg[i][j][1]++;
            }
        }
    }
    while (!q.empty()) {
        int u = q.front().fi.fi;
        int v = q.front().fi.se;
        int who = q.front().se;
        q.pop();

        if (who == 1) {
            for (int i = 0; i < n; i++) {
                if (mat[u][i]) {
                    if (win[i][v][0]) continue;
                    deg[i][v][0]--;
                    if (deg[i][v][0] == 0) {
                        win[i][v][0] = true;
                        q.push(mp(mp(i, v), 0));
                    }
                }
            }
        } else {
            for (int j = 0; j < n; j++) {
                if (mat[v][j] || v == j) {
                    if (win[u][j][1]) continue;
                    mv[u][j] = v;
                    win[u][j][1] = true;
                    q.push(mp(mp(u, j), 1));
                }
            }
        }
    }
    int pos = -1;
    for (int i = 0; i < n; i++) {
        bool yes = true;
        for (int j = 0; j < n; j++)
            yes &= win[j][i][1];
        if (yes) pos = i;
    }
    last_pos = pos;
    return pos;
}

int nextMove(int R) {
    return last_pos = mv[R][last_pos];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 896 KB Output is correct
2 Correct 2 ms 896 KB Output is correct
3 Correct 3 ms 896 KB Output is correct
4 Correct 539 ms 5500 KB Output is correct
5 Correct 72 ms 3064 KB Output is correct
6 Correct 532 ms 5752 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 896 KB Output is correct
2 Correct 2 ms 1024 KB Output is correct
3 Correct 506 ms 5512 KB Output is correct
4 Correct 554 ms 5444 KB Output is correct
5 Correct 548 ms 5500 KB Output is correct
6 Correct 574 ms 5488 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 896 KB Output is correct
2 Correct 2 ms 896 KB Output is correct
3 Correct 2 ms 896 KB Output is correct
4 Correct 2 ms 896 KB Output is correct
5 Correct 3 ms 1024 KB Output is correct
6 Correct 3 ms 868 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 3 ms 1024 KB Output is correct
10 Correct 7 ms 1536 KB Output is correct
11 Correct 11 ms 1664 KB Output is correct
12 Correct 3 ms 1024 KB Output is correct
13 Correct 4 ms 1408 KB Output is correct
14 Correct 10 ms 1508 KB Output is correct
15 Correct 4 ms 1280 KB Output is correct
16 Correct 4 ms 1280 KB Output is correct
17 Correct 15 ms 1792 KB Output is correct
18 Correct 5 ms 1536 KB Output is correct
19 Correct 2 ms 896 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 896 KB Output is correct
2 Correct 2 ms 896 KB Output is correct
3 Correct 2 ms 896 KB Output is correct
4 Correct 541 ms 5596 KB Output is correct
5 Correct 73 ms 3064 KB Output is correct
6 Correct 542 ms 5624 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 2 ms 1024 KB Output is correct
9 Correct 529 ms 5432 KB Output is correct
10 Correct 537 ms 5624 KB Output is correct
11 Correct 525 ms 5364 KB Output is correct
12 Correct 564 ms 5496 KB Output is correct
13 Correct 2 ms 896 KB Output is correct
14 Correct 2 ms 896 KB Output is correct
15 Correct 3 ms 896 KB Output is correct
16 Correct 2 ms 1024 KB Output is correct
17 Correct 7 ms 1536 KB Output is correct
18 Correct 12 ms 1536 KB Output is correct
19 Correct 3 ms 1024 KB Output is correct
20 Correct 5 ms 1408 KB Output is correct
21 Correct 9 ms 1536 KB Output is correct
22 Correct 4 ms 1408 KB Output is correct
23 Correct 4 ms 1280 KB Output is correct
24 Correct 13 ms 1792 KB Output is correct
25 Correct 6 ms 1536 KB Output is correct
26 Correct 29 ms 2304 KB Output is correct
27 Correct 135 ms 3576 KB Output is correct
28 Correct 279 ms 4384 KB Output is correct
29 Correct 1134 ms 8424 KB Output is correct
30 Correct 656 ms 4988 KB Output is correct
31 Correct 666 ms 5240 KB Output is correct
32 Correct 900 ms 7384 KB Output is correct
33 Correct 451 ms 4856 KB Output is correct
34 Correct 1230 ms 8436 KB Output is correct
35 Correct 601 ms 6136 KB Output is correct
36 Correct 1079 ms 7240 KB Output is correct
37 Correct 695 ms 4836 KB Output is correct
38 Correct 3 ms 896 KB Output is correct