oj.uz

Submission #785957

# Submission time Handle Problem Language Result Execution time Memory
785957 2023-07-17T20:28:08 Z bane Cop and Robber (BOI14_coprobber) C++17
100 / 100
 400 ms 8556 KB 
#include "coprobber.h"
#include "bits/stdc++.h"
     
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define fr first
#define mp make_pair
#define sc second
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define vec vector
#define TURBO {ios::sync_with_stdio(0); cin.tie(0);}
     
using namespace std;
     
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
     
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pair<int, int>>;
using vvi = vector<vi>;
    
int orz[MAX_N][MAX_N];
int need[MAX_N][MAX_N][2];
int go[MAX_N][MAX_N];
int cop; 

int start(int n, bool A[MAX_N][MAX_N])
{

    queue<pair<pii,int>>win;

    rep(i,n){
        int deg = 0;
        rep(j,n){
            if (A[i][j])deg++;
        }
        rep(j,n){
            if (i != j){
                need[j][i][1] = 1;
                need[j][i][0] = deg;
            }
        }
    }

    rep(i,n){
        win.push({mp(i,i),0}); 
        win.push({mp(i,i),1}); 
        go[i][i]=i;
        need[i][i][0] = 0;
        need[i][i][1] = 0;
    }

    int B[MAX_N][MAX_N];
    rep(i,n){
        rep(j,n){
            if(i==j)B[i][j]=1;
            else B[i][j] = A[i][j];
        }
    }


    while(!win.empty()){
        auto node = win.front();
        win.pop();
        int turn = node.sc;
        auto [me,him] = node.fr;
        //cout << me << " " << him << " " << turn << endl;
        if (turn){
            rep(i,n){
                if (A[i][him] && need[me][i][0]){
                    need[me][i][0]--;
                    if (need[me][i][0] == 0){
                        win.push(mp(mp(me,i),0));
                    }
                }
            }
        }else{
            rep(i,n){
                if (B[i][me] && need[i][him][1]){
                    need[i][him][1] = 0;
                    go[i][him] = me;
                    win.push(mp(mp(i,him), 1));
                }
            }
        }
    }

    rep(i,n){
        bool ok = 1;
        rep(j,n){
            ok &= (need[i][j][0] == 0);
        }
        if (ok){
            cop = i;
            return i;
        }
    }

    return -1;
}

int nextMove(int R)
{
    cop = go[cop][R];
    return cop;;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Correct 1 ms 1232 KB Output is correct
3 Correct 1 ms 1232 KB Output is correct
4 Correct 206 ms 5552 KB Output is correct
5 Correct 32 ms 3304 KB Output is correct
6 Correct 254 ms 5856 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Correct 1 ms 1360 KB Output is correct
3 Correct 212 ms 5568 KB Output is correct
4 Correct 218 ms 5668 KB Output is correct
5 Correct 209 ms 5636 KB Output is correct
6 Correct 284 ms 5440 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Correct 1 ms 1232 KB Output is correct
3 Correct 1 ms 1232 KB Output is correct
4 Correct 1 ms 1232 KB Output is correct
5 Correct 1 ms 1360 KB Output is correct
6 Correct 1 ms 1232 KB Output is correct
7 Correct 1 ms 1232 KB Output is correct
8 Correct 1 ms 1360 KB Output is correct
9 Correct 1 ms 1360 KB Output is correct
10 Correct 2 ms 1872 KB Output is correct
11 Correct 3 ms 1872 KB Output is correct
12 Correct 1 ms 1360 KB Output is correct
13 Correct 2 ms 1744 KB Output is correct
14 Correct 3 ms 1840 KB Output is correct
15 Correct 2 ms 1616 KB Output is correct
16 Correct 2 ms 1616 KB Output is correct
17 Correct 6 ms 2208 KB Output is correct
18 Correct 1 ms 1872 KB Output is correct
19 Correct 1 ms 1232 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1232 KB Output is correct
2 Correct 1 ms 1232 KB Output is correct
3 Correct 1 ms 1232 KB Output is correct
4 Correct 206 ms 5552 KB Output is correct
5 Correct 32 ms 3304 KB Output is correct
6 Correct 254 ms 5856 KB Output is correct
7 Correct 1 ms 1232 KB Output is correct
8 Correct 1 ms 1360 KB Output is correct
9 Correct 212 ms 5568 KB Output is correct
10 Correct 218 ms 5668 KB Output is correct
11 Correct 209 ms 5636 KB Output is correct
12 Correct 284 ms 5440 KB Output is correct
13 Correct 1 ms 1232 KB Output is correct
14 Correct 1 ms 1232 KB Output is correct
15 Correct 1 ms 1232 KB Output is correct
16 Correct 1 ms 1232 KB Output is correct
17 Correct 1 ms 1360 KB Output is correct
18 Correct 1 ms 1232 KB Output is correct
19 Correct 1 ms 1232 KB Output is correct
20 Correct 1 ms 1360 KB Output is correct
21 Correct 1 ms 1360 KB Output is correct
22 Correct 2 ms 1872 KB Output is correct
23 Correct 3 ms 1872 KB Output is correct
24 Correct 1 ms 1360 KB Output is correct
25 Correct 2 ms 1744 KB Output is correct
26 Correct 3 ms 1840 KB Output is correct
27 Correct 2 ms 1616 KB Output is correct
28 Correct 2 ms 1616 KB Output is correct
29 Correct 6 ms 2208 KB Output is correct
30 Correct 1 ms 1872 KB Output is correct
31 Correct 1 ms 1232 KB Output is correct
32 Correct 1 ms 1232 KB Output is correct
33 Correct 2 ms 1212 KB Output is correct
34 Correct 1 ms 1360 KB Output is correct
35 Correct 243 ms 5552 KB Output is correct
36 Correct 31 ms 3408 KB Output is correct
37 Correct 253 ms 5852 KB Output is correct
38 Correct 1 ms 1232 KB Output is correct
39 Correct 1 ms 1360 KB Output is correct
40 Correct 231 ms 5564 KB Output is correct
41 Correct 208 ms 5632 KB Output is correct
42 Correct 209 ms 5512 KB Output is correct
43 Correct 242 ms 5480 KB Output is correct
44 Correct 1 ms 1232 KB Output is correct
45 Correct 1 ms 1280 KB Output is correct
46 Correct 1 ms 1360 KB Output is correct
47 Correct 1 ms 1360 KB Output is correct
48 Correct 2 ms 1872 KB Output is correct
49 Correct 3 ms 1944 KB Output is correct
50 Correct 1 ms 1360 KB Output is correct
51 Correct 1 ms 1744 KB Output is correct
52 Correct 3 ms 1872 KB Output is correct
53 Correct 2 ms 1616 KB Output is correct
54 Correct 2 ms 1616 KB Output is correct
55 Correct 6 ms 2128 KB Output is correct
56 Correct 2 ms 1872 KB Output is correct
57 Correct 4 ms 2512 KB Output is correct
58 Correct 16 ms 3904 KB Output is correct
59 Correct 25 ms 4476 KB Output is correct
60 Correct 361 ms 8556 KB Output is correct
61 Correct 68 ms 5116 KB Output is correct
62 Correct 65 ms 5220 KB Output is correct
63 Correct 345 ms 7376 KB Output is correct
64 Correct 69 ms 4924 KB Output is correct
65 Correct 388 ms 8300 KB Output is correct
66 Correct 262 ms 6088 KB Output is correct
67 Correct 400 ms 7264 KB Output is correct
68 Correct 164 ms 4936 KB Output is correct
69 Correct 1 ms 1232 KB Output is correct