oj.uz

답안 #84691

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
84691 2018-11-16T14:32:37 Z teomrn 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 348 ms 5292 KB 
#include <bits/stdc++.h>
#include "coprobber.h"

using namespace std;

const int NMAX = 510;
vector <int> adia[NMAX + 10];
bool dp[NMAX + 10][NMAX + 10][2];
int to[NMAX + 10][NMAX + 10];
int liber[NMAX + 10][NMAX + 10];

void open(int x, int y, int who)
{
    dp[x][y][who] = 1;
    if (who == 1) {
        /// muta politistul
        for (auto i : adia[x]) {
            if (!dp[i][y][0]) {
                to[i][y] = x;
                open(i, y, 0);
            }
        }
        if (!dp[x][y][0]) {
            to[x][y] = x;
            open(x, y, 0);
        }
    }
    else {
        /// hotul muta
        for (auto i : adia[y]) {
            liber[x][i]--;
            if (!liber[x][i] && !dp[x][i][1])
                open(x, i, 1);
        }
    }
}

int act;

int start(int N, bool A[MAX_N][MAX_N])
{
    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++)
            if (A[i][j])
                adia[i].push_back(j);

    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++)
            liber[i][j] = adia[j].size();

    for (int i = 0; i < N; i++) {
        if (!dp[i][i][0])
            open(i, i , 0);
        if (!dp[i][i][1])
            open(i, i, 1);
    }

    for (act = 0; act < N; act++) {
        bool ok = 1;
        for (int i = 0; i < N; i++)
            if (!dp[act][i][0])
                ok = 0;
        if (ok)
            return act;
    }
    return -1;
}

int nextMove(int R)
{
    act = to[act][R];
    return act;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 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 50 ms 4472 KB Output is correct
5 Correct 14 ms 2176 KB Output is correct
6 Correct 57 ms 4216 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 51 ms 4320 KB Output is correct
4 Correct 53 ms 4472 KB Output is correct
5 Correct 49 ms 4192 KB Output is correct
6 Correct 53 ms 4344 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 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 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 896 KB Output is correct
11 Correct 3 ms 896 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 3 ms 896 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 7 ms 1124 KB Output is correct
18 Correct 3 ms 896 KB Output is correct
19 Correct 2 ms 384 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 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 55 ms 4600 KB Output is correct
5 Correct 14 ms 2176 KB Output is correct
6 Correct 59 ms 4216 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 54 ms 4348 KB Output is correct
10 Correct 52 ms 4472 KB Output is correct
11 Correct 53 ms 4412 KB Output is correct
12 Correct 53 ms 4344 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 4 ms 868 KB Output is correct
18 Correct 4 ms 896 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 3 ms 1024 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Correct 5 ms 1152 KB Output is correct
25 Correct 4 ms 896 KB Output is correct
26 Correct 5 ms 1536 KB Output is correct
27 Correct 16 ms 2560 KB Output is correct
28 Correct 23 ms 3200 KB Output is correct
29 Correct 348 ms 5292 KB Output is correct
30 Correct 40 ms 3328 KB Output is correct
31 Correct 49 ms 3704 KB Output is correct
32 Correct 247 ms 5244 KB Output is correct
33 Correct 34 ms 3320 KB Output is correct
34 Correct 314 ms 5276 KB Output is correct
35 Correct 61 ms 4088 KB Output is correct
36 Correct 184 ms 4828 KB Output is correct
37 Correct 58 ms 3328 KB Output is correct
38 Correct 2 ms 384 KB Output is correct