oj.uz

답안 #861510

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
861510 2023-10-16T11:44:59 Z Ellinor 경찰관과 강도 (BOI14_coprobber) C++14
100 / 100
 608 ms 20740 KB 
#include "coprobber.h"

#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

#pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
#pragma GCC target("movbe")                                      // byte swap
#pragma GCC target("aes,pclmul,rdrnd")                           // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2")

typedef long long ll;
#define rep(i, a, b) for (int i = (a); i < int(b); i++)
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define pb push_back

// inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }

ll INF = 1e15;
ll mod = 1e9 + 7;

// #define int ll
#define float double

int n;
vector<vector<int>> adj;
int cat = -1;

vector<vector<vector<pii>>> dp;
queue<array<int, 3>> q;

vector<vector<int>> r_edges_left;

void sol(int C, int R, int T)
{
    // cerr << C << " " << R << " " << T << "\n";
    
    if (T == 1) {
        for (int i : adj[R]) {
            r_edges_left[C][i]--;
            // cerr << "-- " << C << " " << i << " status : " << r_edges_left[C][i] << "\n";
            if (r_edges_left[C][i] == 0 && dp[C][i][0].first == -1) {
                q.push({C, i, 0});
            }
        }
    }

    else if (T == 0) {
        if (dp[C][R][1].first == -1) {
            dp[C][R][1].first = 1;
            dp[C][R][1].second = C;
            q.push({C, R, 1});
        }
        dp[C][R][0].first = 1;
        for (int i : adj[C]) {
            if (dp[i][R][1].first == -1) {
                dp[i][R][1].first = 1;
                dp[i][R][1].second = C;
                q.push({i, R, 1});
            }
        }
    }
}


int start(int N, bool A[MAX_N][MAX_N])
{
    n = N;
    adj.assign(n, {});
    rep(i,0,n) {
        rep(j,i + 1,n) {
            if (A[i][j]) {
                adj[i].pb(j);
                adj[j].pb(i);
            }
        }
    }

    dp.assign(n, vector<vector<pii>>(n, vector<pii>(2, {-1, -1})));
    rep(i,0,n) {
        q.push({i, i, 0});
        q.push({i, i, 1});
        dp[i][i][0].first = 1;
        dp[i][i][1].first = 1;
    }

    r_edges_left.assign(n, vector<int>(n, -1));
    rep(i,0,n) {
        rep(j,0,n) {
            r_edges_left[i][j] = adj[j].size();
        }
    }

    while (!q.empty()) {
        auto x = q.front();
        q.pop();
        sol(x[0], x[1], x[2]);
    }

    // rep(i,0,n) {
    //     rep(j,0,n) {
    //         rep(k,0,2) {
    //             cerr << dp[i][j][k].first << " ";
    //         }
    //         cerr << endl;
    //     }
    //     cerr << endl;
    // }

    rep(i,0,n) {
        bool w = true;
        rep(j,0,n) {
            if (dp[i][j][1].first != 1) w = false;
        }
        if (w) {
            return cat = i;
        }
    }

    return -1;
}

int nextMove(int R)
{
    if (cat == R) return cat; //
    return cat = dp[cat][R][1].second;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 52 ms 16500 KB Output is correct
5 Correct 13 ms 4364 KB Output is correct
6 Correct 61 ms 16656 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 58 ms 16220 KB Output is correct
4 Correct 52 ms 16468 KB Output is correct
5 Correct 57 ms 15676 KB Output is correct
6 Correct 49 ms 16200 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 2 ms 1112 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 2 ms 1112 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 4 ms 1368 KB Output is correct
18 Correct 1 ms 856 KB Output is correct
19 Correct 0 ms 540 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 52 ms 16500 KB Output is correct
5 Correct 13 ms 4364 KB Output is correct
6 Correct 61 ms 16656 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 58 ms 16220 KB Output is correct
10 Correct 52 ms 16468 KB Output is correct
11 Correct 57 ms 15676 KB Output is correct
12 Correct 49 ms 16200 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 856 KB Output is correct
23 Correct 2 ms 1112 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 2 ms 1112 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 4 ms 1368 KB Output is correct
30 Correct 1 ms 856 KB Output is correct
31 Correct 0 ms 540 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 55 ms 16880 KB Output is correct
36 Correct 12 ms 4720 KB Output is correct
37 Correct 61 ms 16620 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 57 ms 16164 KB Output is correct
41 Correct 48 ms 16416 KB Output is correct
42 Correct 53 ms 15680 KB Output is correct
43 Correct 49 ms 16196 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 1 ms 856 KB Output is correct
49 Correct 2 ms 1112 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 600 KB Output is correct
52 Correct 2 ms 1112 KB Output is correct
53 Correct 1 ms 756 KB Output is correct
54 Correct 1 ms 600 KB Output is correct
55 Correct 4 ms 1368 KB Output is correct
56 Correct 1 ms 856 KB Output is correct
57 Correct 4 ms 2904 KB Output is correct
58 Correct 17 ms 9984 KB Output is correct
59 Correct 26 ms 15340 KB Output is correct
60 Correct 608 ms 20740 KB Output is correct
61 Correct 47 ms 13968 KB Output is correct
62 Correct 44 ms 16768 KB Output is correct
63 Correct 350 ms 19168 KB Output is correct
64 Correct 51 ms 15952 KB Output is correct
65 Correct 594 ms 20004 KB Output is correct
66 Correct 81 ms 15680 KB Output is correct
67 Correct 239 ms 18616 KB Output is correct
68 Correct 73 ms 15976 KB Output is correct
69 Correct 0 ms 344 KB Output is correct