oj.uz

Submission #977912

# Submission time Handle Problem Language Result Execution time Memory
977912 2024-05-08T13:41:56 Z bachhoangxuan Cop and Robber (BOI14_coprobber) C++17
100 / 100
 529 ms 8992 KB 
#include "coprobber.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 505;
#define pii pair<int,int>
#define piii pair<pii,int>
#define fi first
#define se second
int w[maxn][maxn][2],cnt[maxn],cc[maxn][maxn];
int nxt[maxn][maxn];

int start(int n, bool a[MAX_N][MAX_N])
{
    for(int i=0;i<n;i++) for(int j=0;j<n;j++) cnt[i]+=a[i][j];

    queue<piii> q;
    for(int i=0;i<n;i++) for(int j=0;j<2;j++){
        w[i][i][j]=1;
        q.push({{i,i},j});
    }
    while(!q.empty()){
        auto [P,t]=q.front();q.pop();
        auto [u,v]=P;
        for(int x=0;x<n;x++){
            if(t && (x==u || a[x][u]) && !w[x][v][0]){
                w[x][v][0]=1;
                nxt[x][v]=u;
                q.push({{x,v},0});
            }
            else if(!t && a[x][v] && !w[u][x][1] && (++cc[u][x]>=cnt[x])){
                w[u][x][1]=1;
                q.push({{u,x},1});
            }
        }
    }
    for(int i=0;i<n;i++) if(!w[0][i][0]) return -1;
    return 0;
}

int p=0;
int nextMove(int R)
{
    return p=nxt[p][R];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2556 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 435 ms 5864 KB Output is correct
5 Correct 60 ms 4216 KB Output is correct
6 Correct 443 ms 6056 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2552 KB Output is correct
2 Correct 1 ms 2556 KB Output is correct
3 Correct 367 ms 5928 KB Output is correct
4 Correct 348 ms 5880 KB Output is correct
5 Correct 361 ms 6160 KB Output is correct
6 Correct 405 ms 5888 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 560 KB Output is correct
10 Correct 2 ms 3156 KB Output is correct
11 Correct 3 ms 3160 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 2 ms 2904 KB Output is correct
14 Correct 3 ms 3208 KB Output is correct
15 Correct 2 ms 2900 KB Output is correct
16 Correct 3 ms 2904 KB Output is correct
17 Correct 7 ms 3416 KB Output is correct
18 Correct 2 ms 3160 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2556 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 435 ms 5864 KB Output is correct
5 Correct 60 ms 4216 KB Output is correct
6 Correct 443 ms 6056 KB Output is correct
7 Correct 1 ms 2552 KB Output is correct
8 Correct 1 ms 2556 KB Output is correct
9 Correct 367 ms 5928 KB Output is correct
10 Correct 348 ms 5880 KB Output is correct
11 Correct 361 ms 6160 KB Output is correct
12 Correct 405 ms 5888 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 560 KB Output is correct
22 Correct 2 ms 3156 KB Output is correct
23 Correct 3 ms 3160 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 2 ms 2904 KB Output is correct
26 Correct 3 ms 3208 KB Output is correct
27 Correct 2 ms 2900 KB Output is correct
28 Correct 3 ms 2904 KB Output is correct
29 Correct 7 ms 3416 KB Output is correct
30 Correct 2 ms 3160 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
33 Correct 1 ms 2400 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 358 ms 5868 KB Output is correct
36 Correct 59 ms 4284 KB Output is correct
37 Correct 406 ms 6164 KB Output is correct
38 Correct 1 ms 2392 KB Output is correct
39 Correct 1 ms 2392 KB Output is correct
40 Correct 358 ms 5860 KB Output is correct
41 Correct 416 ms 5876 KB Output is correct
42 Correct 335 ms 6080 KB Output is correct
43 Correct 412 ms 5892 KB Output is correct
44 Correct 1 ms 2392 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 1 ms 2552 KB Output is correct
47 Correct 1 ms 600 KB Output is correct
48 Correct 2 ms 3172 KB Output is correct
49 Correct 3 ms 3160 KB Output is correct
50 Correct 1 ms 600 KB Output is correct
51 Correct 2 ms 2904 KB Output is correct
52 Correct 4 ms 3160 KB Output is correct
53 Correct 2 ms 2904 KB Output is correct
54 Correct 2 ms 2904 KB Output is correct
55 Correct 7 ms 3668 KB Output is correct
56 Correct 2 ms 3160 KB Output is correct
57 Correct 4 ms 3416 KB Output is correct
58 Correct 15 ms 4472 KB Output is correct
59 Correct 31 ms 5012 KB Output is correct
60 Correct 491 ms 8992 KB Output is correct
61 Correct 75 ms 5684 KB Output is correct
62 Correct 73 ms 5784 KB Output is correct
63 Correct 452 ms 7628 KB Output is correct
64 Correct 95 ms 5480 KB Output is correct
65 Correct 500 ms 8764 KB Output is correct
66 Correct 415 ms 6584 KB Output is correct
67 Correct 529 ms 7736 KB Output is correct
68 Correct 216 ms 5228 KB Output is correct
69 Correct 1 ms 2392 KB Output is correct