oj.uz

Submission #957116

# Submission time Handle Problem Language Result Execution time Memory
957116 2024-04-03T03:54:11 Z GrindMachine Cop and Robber (BOI14_coprobber) C++17
100 / 100
 377 ms 13796 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "coprobber.h"

int n;
int dp[MAX_N][MAX_N][2];
bool a[MAX_N][MAX_N];
vector<int> adj[MAX_N];
int pos;
int par[MAX_N][MAX_N][2];

int start(int n_, bool a_[MAX_N][MAX_N])
{
    n = n_;
    rep(i,MAX_N){
        adj[i].clear();
    }

    rep(i,MAX_N){
        rep(j,MAX_N){
            a[i][j] = a_[i][j];
            if(a[i][j]){
                adj[i].pb(j);
            }
        }
    }

    memset(dp,-1,sizeof dp);
    memset(par,-1,sizeof par);
    queue<array<int,3>> q;

    rep(i,n){
        dp[i][i][0] = 1;
        dp[i][i][1] = 0;
        q.push({i,i,0});
        q.push({i,i,1});
    }

    int win_cnt[n][n][2], lose_cnt[n][n][2];
    memset(win_cnt,0,sizeof win_cnt);
    memset(lose_cnt,0,sizeof lose_cnt);

    rep(i,n){
        rep(j,n){
            if(i == j) conts;
            rep(k,2){
                if(k == 0){
                    win_cnt[i][j][k] = sz(adj[i])+1;
                }
                else{
                    lose_cnt[i][j][k] = sz(adj[j]);
                }
            }
        }
    }

    while(!q.empty()){
        auto [i,j,k] = q.front();
        q.pop();

        if(k == 0){
            // police wins, sub 1 from lose_cnt[i][v][k^1]
            if(dp[i][j][k]){
                trav(v,adj[j]){
                    if(dp[i][v][k^1] == -1){
                        lose_cnt[i][v][k^1]--;
                        if(!lose_cnt[i][v][k^1]){
                            q.push({i,v,k^1});
                            dp[i][v][k^1] = 0;
                        }   
                    }
                }
            }
            // police loses, add unvis adj robber states
            else{
                trav(v,adj[j]){
                    if(dp[i][v][k^1] == -1){
                        q.push({i,v,k^1});
                        dp[i][v][k^1] = 1;
                        par[i][v][k^1] = j;
                    }
                }
            }
        }
        else{
            // robber loses, add unvis adj police states
            if(!dp[i][j][k]){
                trav(v,adj[i]){
                    if(dp[v][j][k^1] == -1){
                        q.push({v,j,k^1});
                        dp[v][j][k^1] = 1;
                        par[v][j][k^1] = i;
                    }
                }

                {
                    int v = i;
                    if(dp[v][j][k^1] == -1){
                        q.push({v,j,k^1});
                        dp[v][j][k^1] = 1;
                        par[v][j][k^1] = i;
                    }
                }
            }
            // robber wins, sub 1 from win_cnt[v][j][k^1]
            else{
                trav(v,adj[i]){
                    if(dp[v][j][k^1] == -1){
                        win_cnt[v][j][k^1]--;
                        if(!win_cnt[v][j][k^1]){
                            q.push({v,j,k^1});
                            dp[v][j][k^1] = 0;
                        }   
                    }
                }

                {
                    int v = i;
                    if(dp[v][j][k^1] == -1){
                        win_cnt[v][j][k^1]--;
                        if(!win_cnt[v][j][k^1]){
                            q.push({v,j,k^1});
                            dp[v][j][k^1] = 0;
                        }   
                    }
                }
            }
        }
    }

    // rep(i,n){
    //     rep(j,n){
    //         cout << dp[i][j][0] << " " << dp[i][j][1] << endl;
    //     }
    //     cout << endl;
    // }

    pos = -1;

    rep(u,n){
        bool ok = true;
        rep(v,n){
            if(dp[u][v][0] != 1){
                ok = false;
            }
        }

        if(ok){
            pos = u;
        }
    }

    return pos;
}

int nextMove(int v)
{
    pos = par[pos][v][0];
    return pos;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Correct 43 ms 10012 KB Output is correct
5 Correct 12 ms 6120 KB Output is correct
6 Correct 50 ms 10272 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 44 ms 9868 KB Output is correct
4 Correct 45 ms 9784 KB Output is correct
5 Correct 43 ms 9620 KB Output is correct
6 Correct 53 ms 9808 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Correct 1 ms 4696 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 2 ms 4696 KB Output is correct
7 Correct 1 ms 4696 KB Output is correct
8 Correct 1 ms 4696 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 2 ms 4696 KB Output is correct
11 Correct 3 ms 5148 KB Output is correct
12 Correct 1 ms 4696 KB Output is correct
13 Correct 2 ms 4696 KB Output is correct
14 Correct 2 ms 4952 KB Output is correct
15 Correct 2 ms 4696 KB Output is correct
16 Correct 2 ms 4696 KB Output is correct
17 Correct 5 ms 5204 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 1 ms 4696 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Correct 43 ms 10012 KB Output is correct
5 Correct 12 ms 6120 KB Output is correct
6 Correct 50 ms 10272 KB Output is correct
7 Correct 1 ms 4696 KB Output is correct
8 Correct 1 ms 4696 KB Output is correct
9 Correct 44 ms 9868 KB Output is correct
10 Correct 45 ms 9784 KB Output is correct
11 Correct 43 ms 9620 KB Output is correct
12 Correct 53 ms 9808 KB Output is correct
13 Correct 1 ms 4696 KB Output is correct
14 Correct 1 ms 4696 KB Output is correct
15 Correct 1 ms 4696 KB Output is correct
16 Correct 1 ms 4696 KB Output is correct
17 Correct 1 ms 4696 KB Output is correct
18 Correct 2 ms 4696 KB Output is correct
19 Correct 1 ms 4696 KB Output is correct
20 Correct 1 ms 4696 KB Output is correct
21 Correct 1 ms 4696 KB Output is correct
22 Correct 2 ms 4696 KB Output is correct
23 Correct 3 ms 5148 KB Output is correct
24 Correct 1 ms 4696 KB Output is correct
25 Correct 2 ms 4696 KB Output is correct
26 Correct 2 ms 4952 KB Output is correct
27 Correct 2 ms 4696 KB Output is correct
28 Correct 2 ms 4696 KB Output is correct
29 Correct 5 ms 5204 KB Output is correct
30 Correct 2 ms 4948 KB Output is correct
31 Correct 1 ms 4696 KB Output is correct
32 Correct 1 ms 4696 KB Output is correct
33 Correct 1 ms 4696 KB Output is correct
34 Correct 1 ms 4696 KB Output is correct
35 Correct 44 ms 9988 KB Output is correct
36 Correct 12 ms 6252 KB Output is correct
37 Correct 48 ms 10048 KB Output is correct
38 Correct 1 ms 4696 KB Output is correct
39 Correct 2 ms 4572 KB Output is correct
40 Correct 56 ms 10148 KB Output is correct
41 Correct 44 ms 9808 KB Output is correct
42 Correct 43 ms 9724 KB Output is correct
43 Correct 47 ms 9692 KB Output is correct
44 Correct 2 ms 4696 KB Output is correct
45 Correct 1 ms 4488 KB Output is correct
46 Correct 1 ms 4696 KB Output is correct
47 Correct 1 ms 4696 KB Output is correct
48 Correct 2 ms 4696 KB Output is correct
49 Correct 2 ms 4952 KB Output is correct
50 Correct 2 ms 4696 KB Output is correct
51 Correct 2 ms 4696 KB Output is correct
52 Correct 2 ms 4696 KB Output is correct
53 Correct 2 ms 4696 KB Output is correct
54 Correct 2 ms 4696 KB Output is correct
55 Correct 4 ms 5208 KB Output is correct
56 Correct 2 ms 4696 KB Output is correct
57 Correct 4 ms 5208 KB Output is correct
58 Correct 13 ms 7264 KB Output is correct
59 Correct 21 ms 8800 KB Output is correct
60 Correct 377 ms 13796 KB Output is correct
61 Correct 44 ms 9320 KB Output is correct
62 Correct 40 ms 10092 KB Output is correct
63 Correct 242 ms 12568 KB Output is correct
64 Correct 30 ms 9360 KB Output is correct
65 Correct 279 ms 13672 KB Output is correct
66 Correct 52 ms 10272 KB Output is correct
67 Correct 150 ms 11828 KB Output is correct
68 Correct 52 ms 9392 KB Output is correct
69 Correct 1 ms 4696 KB Output is correct