oj.uz

Submission #961354

# Submission time Handle Problem Language Result Execution time Memory
961354 2024-04-11T22:17:48 Z berr Cop and Robber (BOI14_coprobber) C++17
60 / 100
 461 ms 262144 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> g[n+1];
 
    for(int i=0; i<n; i++){
        for(int l=0; l<n; l++){
            b[i][l]=-1;
            if(a[i][l]){
                g[i].push_back(l);
            }
        }
    }

    vector<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_back({i, i, 1});
        q.push_back({i, i, 0});
    }

    while(pos<q.size()){
        auto [x, y, z]=q[pos];
        if(vis[x][y][z]){ 
            pos++;
        }
        else{           
           // cout<<val[x][y][z]<<"\n";
            vis[x][y][z]=1;
            if(z==0){
                val[x][y][z]=1;
                for(auto i: g[y]){
                    c[x][i]++;
                    if(c[x][i]==g[i].size()){
                        val[x][i][1]=0;
                        q.push_back({x, i, 1}); 
                    }
                }
            }
            else {
                val[x][y][z] = 0;

                for(auto i: g[x]){
                    if(b[i][y]==-1)
                    b[i][y]=x;
                    q.push_back({i, y, 0});
                }
                if(b[x][y]==-1)
                b[x][y]=x;
                q.push_back({x, y, 0});
                
            }

            pos++;
        }
    }

    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];
}

Compilation message

coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:34:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     while(pos<q.size()){
      |           ~~~^~~~~~~~~
coprobber.cpp:46:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |                     if(c[x][i]==g[i].size()){
      |                        ~~~~~~~^~~~~~~~~~~~~

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 6488 KB Output is correct
3 Correct 2 ms 6488 KB Output is correct
4 Correct 52 ms 20844 KB Output is correct
5 Correct 14 ms 11648 KB Output is correct
6 Correct 60 ms 21456 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 1 ms 6488 KB Output is correct
3 Correct 73 ms 33096 KB Output is correct
4 Correct 45 ms 32904 KB Output is correct
5 Correct 53 ms 32612 KB Output is correct
6 Correct 57 ms 34444 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6484 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 6744 KB Output is correct
11 Correct 2 ms 7000 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 2 ms 6740 KB Output is correct
14 Correct 3 ms 7508 KB Output is correct
15 Correct 2 ms 7192 KB Output is correct
16 Correct 3 ms 7512 KB Output is correct
17 Correct 11 ms 13776 KB Output is correct
18 Correct 2 ms 6744 KB Output is correct
19 Correct 1 ms 6488 KB Output is correct

Subtask #4
0 / 40.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 2 ms 6488 KB Output is correct
4 Correct 52 ms 20844 KB Output is correct
5 Correct 14 ms 11648 KB Output is correct
6 Correct 60 ms 21456 KB Output is correct
7 Correct 1 ms 6488 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 73 ms 33096 KB Output is correct
10 Correct 45 ms 32904 KB Output is correct
11 Correct 53 ms 32612 KB Output is correct
12 Correct 57 ms 34444 KB Output is correct
13 Correct 1 ms 6484 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 6744 KB Output is correct
23 Correct 2 ms 7000 KB Output is correct
24 Correct 1 ms 4440 KB Output is correct
25 Correct 2 ms 6740 KB Output is correct
26 Correct 3 ms 7508 KB Output is correct
27 Correct 2 ms 7192 KB Output is correct
28 Correct 3 ms 7512 KB Output is correct
29 Correct 11 ms 13776 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 49 ms 20856 KB Output is correct
36 Correct 14 ms 10288 KB Output is correct
37 Correct 62 ms 20816 KB Output is correct
38 Correct 1 ms 6592 KB Output is correct
39 Correct 1 ms 6484 KB Output is correct
40 Correct 62 ms 34340 KB Output is correct
41 Correct 60 ms 33016 KB Output is correct
42 Correct 49 ms 32456 KB Output is correct
43 Correct 47 ms 34124 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 1 ms 4440 KB Output is correct
48 Correct 2 ms 6744 KB Output is correct
49 Correct 2 ms 7000 KB Output is correct
50 Correct 1 ms 4440 KB Output is correct
51 Correct 1 ms 6744 KB Output is correct
52 Correct 4 ms 7760 KB Output is correct
53 Correct 2 ms 7192 KB Output is correct
54 Correct 2 ms 7512 KB Output is correct
55 Correct 11 ms 14024 KB Output is correct
56 Correct 2 ms 6744 KB Output is correct
57 Correct 6 ms 6744 KB Output is correct
58 Correct 11 ms 7000 KB Output is correct
59 Correct 18 ms 7060 KB Output is correct
60 Runtime error 461 ms 262144 KB Execution killed with signal 9
61 Halted 0 ms 0 KB -