oj.uz

답안 #648232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
648232 2022-10-05T19:03:05 Z Ronin13 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 598 ms 14404 KB 
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll
using namespace std;

#define MAX_N 500

// modify the following functions
// you can define global variables and functions

int deg[MAX_N][MAX_N][2];
bool used[MAX_N][MAX_N][2];
vector <vector <int> > g(MAX_N);
bool dp[MAX_N][MAX_N][2];
int cur;

struct state{
    int a, b, c;
    state(int a, int b, int c) : a(a), b(b), c(c){
    }
    state(){
        a = b = c = 0;
    }
}wining[MAX_N][MAX_N][2];

int start(int N, bool A[MAX_N][MAX_N]) {
    int n = N;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(A[i][j]) g[i].pb(j);
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            deg[i][j][0] = g[i].size() + 1;
            deg[i][j][1] = g[j].size();
        }
    }
    queue <state> q;
    for(int i= 0; i < n; i++){
        dp[i][i][0] = 1;
        dp[i][i][1] = 0;
        q.push({i, i, 0});
        q.push({i, i, 1});
        used[i][i][1] = used[i][i][0] = 1;
    }
    while(!q.empty()){
        state cur = q.front(); q.pop();
        int a = cur.a, b = cur.b, type = cur.c;
        if(type == 0){
            for(int to : g[b]){
                if(used[a][to][1]) continue;
                if(dp[a][b][0])deg[a][to][1]--;
                if(!dp[a][b][0]){
                    dp[a][to][1] = 1;
                    wining[a][to][1] = {a, b, 0};
                    q.push({a, to, 1});
                    used[a][to][1] = true;
                    continue;
                }
                if(!deg[a][to][1])
                    dp[a][to][1] = 0, used[a][to][1] = 1, q.push({a, to, 1});
            }
        }else{
            for(int to : g[a]){
                if(used[to][b][0]) continue;
                if(dp[a][b][1]) deg[to][b][0]--;
                if(!dp[a][b][1]){
                    dp[to][b][0] = 1;
                    q.push({to, b, 0});
                    wining[to][b][0] = {a, b, 1};
                    used[to][b][0] = true;
                    continue;
                }
                if(!deg[to][b][0])
                    dp[to][b][0] = 0, used[to][b][0] = 1, q.push({to, b, 0});
            }
            if(used[a][b][0]) continue;
            if(dp[a][b][1]) deg[a][b][0]--;
            if(!dp[a][b][1]){
                dp[a][b][0] = 1;
                q.push({a, b, 0});
                wining[a][b][0] = {a, b, 1};
                used[a][b][0] = true;
                continue;
            }
            if(!deg[a][b][0])
                dp[a][b][0] = 0, used[a][b][0] = 1, q.push({a, b, 0});
        }

    }
    for(int i = 0; i < n; i++){
        bool ind = true;
        for(int j = 0; j < n; j++)
            ind &= dp[i][j][0];
        if(ind) {
            cur = i;
            return i;
        }
    }
    return -1;
}

int nextMove(int R) {
    cur = wining[cur][R][0].a;
    return cur;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6096 KB Output is correct
2 Correct 3 ms 6224 KB Output is correct
3 Correct 3 ms 6224 KB Output is correct
4 Correct 55 ms 10476 KB Output is correct
5 Correct 22 ms 8292 KB Output is correct
6 Correct 82 ms 10760 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6224 KB Output is correct
2 Correct 3 ms 6224 KB Output is correct
3 Correct 61 ms 10592 KB Output is correct
4 Correct 65 ms 10484 KB Output is correct
5 Correct 64 ms 10524 KB Output is correct
6 Correct 79 ms 10384 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6096 KB Output is correct
2 Correct 4 ms 6224 KB Output is correct
3 Correct 4 ms 6224 KB Output is correct
4 Correct 4 ms 6224 KB Output is correct
5 Correct 4 ms 6224 KB Output is correct
6 Correct 4 ms 6224 KB Output is correct
7 Correct 4 ms 6224 KB Output is correct
8 Correct 4 ms 6224 KB Output is correct
9 Correct 5 ms 6224 KB Output is correct
10 Correct 6 ms 6736 KB Output is correct
11 Correct 6 ms 6876 KB Output is correct
12 Correct 5 ms 6352 KB Output is correct
13 Correct 4 ms 6608 KB Output is correct
14 Correct 7 ms 6856 KB Output is correct
15 Correct 5 ms 6608 KB Output is correct
16 Correct 4 ms 6608 KB Output is correct
17 Correct 9 ms 7044 KB Output is correct
18 Correct 5 ms 6736 KB Output is correct
19 Correct 4 ms 6224 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 6096 KB Output is correct
2 Correct 3 ms 6224 KB Output is correct
3 Correct 3 ms 6224 KB Output is correct
4 Correct 55 ms 10476 KB Output is correct
5 Correct 22 ms 8292 KB Output is correct
6 Correct 82 ms 10760 KB Output is correct
7 Correct 3 ms 6224 KB Output is correct
8 Correct 3 ms 6224 KB Output is correct
9 Correct 61 ms 10592 KB Output is correct
10 Correct 65 ms 10484 KB Output is correct
11 Correct 64 ms 10524 KB Output is correct
12 Correct 79 ms 10384 KB Output is correct
13 Correct 3 ms 6096 KB Output is correct
14 Correct 4 ms 6224 KB Output is correct
15 Correct 4 ms 6224 KB Output is correct
16 Correct 4 ms 6224 KB Output is correct
17 Correct 4 ms 6224 KB Output is correct
18 Correct 4 ms 6224 KB Output is correct
19 Correct 4 ms 6224 KB Output is correct
20 Correct 4 ms 6224 KB Output is correct
21 Correct 5 ms 6224 KB Output is correct
22 Correct 6 ms 6736 KB Output is correct
23 Correct 6 ms 6876 KB Output is correct
24 Correct 5 ms 6352 KB Output is correct
25 Correct 4 ms 6608 KB Output is correct
26 Correct 7 ms 6856 KB Output is correct
27 Correct 5 ms 6608 KB Output is correct
28 Correct 4 ms 6608 KB Output is correct
29 Correct 9 ms 7044 KB Output is correct
30 Correct 5 ms 6736 KB Output is correct
31 Correct 4 ms 6224 KB Output is correct
32 Correct 3 ms 6096 KB Output is correct
33 Correct 3 ms 6224 KB Output is correct
34 Correct 3 ms 6224 KB Output is correct
35 Correct 77 ms 10560 KB Output is correct
36 Correct 20 ms 8272 KB Output is correct
37 Correct 67 ms 10696 KB Output is correct
38 Correct 3 ms 6224 KB Output is correct
39 Correct 3 ms 6220 KB Output is correct
40 Correct 65 ms 10604 KB Output is correct
41 Correct 58 ms 10556 KB Output is correct
42 Correct 73 ms 10536 KB Output is correct
43 Correct 65 ms 10380 KB Output is correct
44 Correct 3 ms 6104 KB Output is correct
45 Correct 3 ms 6224 KB Output is correct
46 Correct 4 ms 6224 KB Output is correct
47 Correct 4 ms 6224 KB Output is correct
48 Correct 4 ms 6736 KB Output is correct
49 Correct 5 ms 6864 KB Output is correct
50 Correct 3 ms 6352 KB Output is correct
51 Correct 4 ms 6608 KB Output is correct
52 Correct 5 ms 6864 KB Output is correct
53 Correct 4 ms 6608 KB Output is correct
54 Correct 4 ms 6608 KB Output is correct
55 Correct 8 ms 7120 KB Output is correct
56 Correct 4 ms 6736 KB Output is correct
57 Correct 7 ms 7376 KB Output is correct
58 Correct 17 ms 8652 KB Output is correct
59 Correct 26 ms 9416 KB Output is correct
60 Correct 598 ms 14404 KB Output is correct
61 Correct 77 ms 10392 KB Output is correct
62 Correct 72 ms 10688 KB Output is correct
63 Correct 424 ms 13100 KB Output is correct
64 Correct 48 ms 10064 KB Output is correct
65 Correct 475 ms 14248 KB Output is correct
66 Correct 73 ms 11036 KB Output is correct
67 Correct 229 ms 12516 KB Output is correct
68 Correct 80 ms 10012 KB Output is correct
69 Correct 3 ms 6224 KB Output is correct