oj.uz

Submission #961360

# Submission time Handle Problem Language Result Execution time Memory
961360 2024-04-11T22:25:08 Z berr Cop and Robber (BOI14_coprobber) C++17
100 / 100
 476 ms 58336 KB 
#include <bits/stdc++.h>
using namespace std;
# include "coprobber.h"
 
int pos;
int val[505][505][2];
int vis[505][505][2];
int b[505][505], c[505][505];
 
int start(int n, bool a[MAX_N][MAX_N]) {
 
    vector<int> e(n); 
    for(int i=0; i<n; i++){
        for(int l=0; l<n; l++){
            b[i][l]=-1;
            if(a[i][l]){
                e[i]++;
            }
        }
    }
 
    queue<array<int, 3>> q;
 
    for(int i=0; i<n; i++){
        val[i][i][0]=1;
        val[i][i][1]=0;
        b[i][i]=i;
        q.push({i, i, 1});
        q.push({i, i, 0});
    }
 
    while(q.size()){
        auto [x, y, z]=q.front();
        q.pop();
        if(vis[x][y][z]){ 
            continue;
        }
        else{           
           // cout<<val[x][y][z]<<"\n";
            vis[x][y][z]=1;
            if(z==0){
                val[x][y][z]=1;
                for(int i=0; i<n; i++){
                    if(!a[i][y]||vis[x][i][1]) continue;
                    c[x][i]++;
                    if(c[x][i]==e[i]){
                        val[x][i][1]=0;
                        q.push({x, i, 1}); 
                    }
                }
            }
            else {
                val[x][y][z] = 0;
                for(int i=0; i<n; i++){
                    if(!a[i][x]||vis[i][y][0]) continue;
                    if(b[i][y]==-1) b[i][y]=x;
                    q.push({i, y, 0});
                }
                if(b[x][y]==-1) b[x][y]=x;
                q.push({x, y, 0});
                
            }
 
        }
    }
 
    for(int i=0; i<n; i++){
        int flag=1;
        for(int j=0; j<n; j++){
            if(val[i][j][0]==0){
                flag=0;
            }
            
        }
        if(flag){
            return pos=i;
        }
    }
 
    return -1;
}
 
int nextMove(int R) {
    return pos=b[pos][R];
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6596 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 260 ms 7884 KB Output is correct
5 Correct 35 ms 7308 KB Output is correct
6 Correct 268 ms 8384 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 4 ms 6488 KB Output is correct
3 Correct 253 ms 8164 KB Output is correct
4 Correct 261 ms 8124 KB Output is correct
5 Correct 254 ms 8456 KB Output is correct
6 Correct 312 ms 7940 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 1 ms 6488 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 2 ms 6636 KB Output is correct
11 Correct 3 ms 6744 KB Output is correct
12 Correct 1 ms 4696 KB Output is correct
13 Correct 2 ms 6744 KB Output is correct
14 Correct 3 ms 6744 KB Output is correct
15 Correct 2 ms 6488 KB Output is correct
16 Correct 2 ms 6744 KB Output is correct
17 Correct 7 ms 7000 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct
19 Correct 1 ms 6488 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6596 KB Output is correct
3 Correct 1 ms 6488 KB Output is correct
4 Correct 260 ms 7884 KB Output is correct
5 Correct 35 ms 7308 KB Output is correct
6 Correct 268 ms 8384 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 4 ms 6488 KB Output is correct
9 Correct 253 ms 8164 KB Output is correct
10 Correct 261 ms 8124 KB Output is correct
11 Correct 254 ms 8456 KB Output is correct
12 Correct 312 ms 7940 KB Output is correct
13 Correct 1 ms 6488 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6488 KB Output is correct
16 Correct 1 ms 6488 KB Output is correct
17 Correct 1 ms 6488 KB Output is correct
18 Correct 1 ms 6488 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 6488 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 2 ms 6636 KB Output is correct
23 Correct 3 ms 6744 KB Output is correct
24 Correct 1 ms 4696 KB Output is correct
25 Correct 2 ms 6744 KB Output is correct
26 Correct 3 ms 6744 KB Output is correct
27 Correct 2 ms 6488 KB Output is correct
28 Correct 2 ms 6744 KB Output is correct
29 Correct 7 ms 7000 KB Output is correct
30 Correct 2 ms 6744 KB Output is correct
31 Correct 1 ms 6488 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct
33 Correct 1 ms 6488 KB Output is correct
34 Correct 1 ms 6488 KB Output is correct
35 Correct 252 ms 7896 KB Output is correct
36 Correct 36 ms 7396 KB Output is correct
37 Correct 259 ms 8500 KB Output is correct
38 Correct 1 ms 6488 KB Output is correct
39 Correct 1 ms 6496 KB Output is correct
40 Correct 259 ms 8160 KB Output is correct
41 Correct 262 ms 7816 KB Output is correct
42 Correct 296 ms 8456 KB Output is correct
43 Correct 267 ms 7944 KB Output is correct
44 Correct 1 ms 6488 KB Output is correct
45 Correct 1 ms 4440 KB Output is correct
46 Correct 1 ms 6488 KB Output is correct
47 Correct 2 ms 4440 KB Output is correct
48 Correct 2 ms 6744 KB Output is correct
49 Correct 3 ms 6744 KB Output is correct
50 Correct 1 ms 4440 KB Output is correct
51 Correct 2 ms 6744 KB Output is correct
52 Correct 3 ms 6744 KB Output is correct
53 Correct 2 ms 6488 KB Output is correct
54 Correct 2 ms 6744 KB Output is correct
55 Correct 7 ms 7000 KB Output is correct
56 Correct 2 ms 6744 KB Output is correct
57 Correct 4 ms 6744 KB Output is correct
58 Correct 11 ms 6952 KB Output is correct
59 Correct 18 ms 7072 KB Output is correct
60 Correct 408 ms 10920 KB Output is correct
61 Correct 70 ms 7956 KB Output is correct
62 Correct 73 ms 7820 KB Output is correct
63 Correct 476 ms 58336 KB Output is correct
64 Correct 64 ms 7564 KB Output is correct
65 Correct 440 ms 12732 KB Output is correct
66 Correct 279 ms 10792 KB Output is correct
67 Correct 460 ms 22196 KB Output is correct
68 Correct 180 ms 8156 KB Output is correct
69 Correct 1 ms 6488 KB Output is correct