oj.uz

Submission #136037

# Submission time Handle Problem Language Result Execution time Memory
136037 2019-07-24T16:04:11 Z forelax Cop and Robber (BOI14_coprobber) C++14
100 / 100
 1084 ms 142844 KB 
#include "coprobber.h"
#include<bits/stdc++.h>
using namespace std;
vector<vector<bool> > wing(500,vector<bool> (500));
vector<vector<bool> > winb(500,vector<bool> (500));
vector<vector<int> > cntl(500,vector<int> (500));
vector<vector<int> > go(500,vector<int> (500));
vector<vector<bool> > a(500,vector<bool> (500));
vector<vector<int> > edge(500,vector<int> (500));
vector<int> eds(500);
int n,cr=0;
int start(int _N,bool A[500][500]){
    n=_N;
    int qs=0;
    vector<vector<int> > q(500*500*10,vector<int> (3));
    for(int i = 0 ; i < n ; i ++){
        for(int j = 0 ; j < n ; j ++){
            a[i][j]=A[i][j];
            if(a[i][j]){
                edge[i][eds[i]++]=j;
                wing[i][j]=true;
                q[qs][0]=0;
                q[qs][1]=i;
                q[qs][2]=j;
                qs++;
                go[i][j]=j;
            }
        }
    }
    for(int i = 0 ; i < n ; i ++){
        for(int j = 0 ; j < n ; j ++){
            if(i==j)continue;
            cntl[i][j]=eds[j];
            if(a[j][i])cntl[i][j]--;
        }
    }
    int cp=0;
    while(cp<qs){
        int x=q[cp][2];
        int y=q[cp][1];
        int st=q[cp][0];
        cp++;
        if(st==0){
            for(int i = 0 ; i < eds[x] ; i ++){
                int ne=edge[x][i];
                if(ne==y)continue;
                cntl[y][ne]--;
                if(cntl[y][ne])continue;
                q[qs][0]=1;
                q[qs][1]=y;
                q[qs][2]=ne;
                qs++;
                winb[y][ne]=true;
            }
        }else{
            for(int i = 0,ne ; i <= eds[y] ; i ++){
                if(i<eds[y])ne=edge[y][i];
                else ne=y;
                if(ne==x)continue;
                if(wing[ne][x])continue;
                go[ne][x]=y;
                wing[ne][x]=true;
                q[qs][0]=0;
                q[qs][1]=ne;
                q[qs][2]=x;
                qs++;
            }
        }
    }
    cr=-1;
//    for(int i = 0 ; i < n ; i ++){
//        for(int j = 0 ; j < n ; j ++){
//            cout<<wing[i][j];
//        }cout<<endl;}cout<<endl;
    for(int i = 0 ; i < n ; i ++){
        bool good=true;
        for(int j = 0 ; j < n ; j ++){
            if(i==j)continue;
            if(!wing[i][j]){
                good=false;
                break;
            }
        }
        if(!good)continue;
        cr=i;
        break;
    }
//    cout<<cr<<" ";
    return cr;
}
int nextMove(int np){
    cr=go[cr][np];
//    cout<<np<<" "<<cr<<" "<<endl;
    return cr;
}
//int main(){
//    int N;
//    cin>>N;
//    bool A[500][500];
////    vector<vector<bool> > A(N,vector<bool> (N));
//    for(int i = 0,g ; i < N ;i ++){
//        for(int j = 0 ; j < N ; j ++){
//            cin>>g;
//            A[i][j]=g;
//        }
//    }
//    int CP=start(N,A),one;
//    cin>>one;
//    vector<vector<int> > dir(n,vector<int> (n+1));
//    for(int i = 0 ; i < N ; i ++)
//        for(int j = 0 ; j <= N ; j ++)
//            cin>>dir[i][j];
//    int BP=dir[CP].back();
//    while(CP!=BP){
//        cout<<CP<<" "<<BP<<" ";
//        BP=dir[CP][BP];
//        CP=nextMove(BP);
//    }
//    cout<<CP<<" "<<BP;
//}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 237 ms 140532 KB Output is correct
2 Correct 242 ms 140516 KB Output is correct
3 Correct 240 ms 140524 KB Output is correct
4 Correct 306 ms 142140 KB Output is correct
5 Correct 262 ms 141372 KB Output is correct
6 Correct 321 ms 142080 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 140572 KB Output is correct
2 Correct 243 ms 140516 KB Output is correct
3 Correct 301 ms 142092 KB Output is correct
4 Correct 304 ms 142028 KB Output is correct
5 Correct 300 ms 142200 KB Output is correct
6 Correct 305 ms 142328 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 140536 KB Output is correct
2 Correct 241 ms 140448 KB Output is correct
3 Correct 241 ms 140536 KB Output is correct
4 Correct 239 ms 140516 KB Output is correct
5 Correct 238 ms 140536 KB Output is correct
6 Correct 245 ms 140508 KB Output is correct
7 Correct 239 ms 140536 KB Output is correct
8 Correct 253 ms 140664 KB Output is correct
9 Correct 239 ms 140456 KB Output is correct
10 Correct 239 ms 140540 KB Output is correct
11 Correct 240 ms 140536 KB Output is correct
12 Correct 238 ms 140472 KB Output is correct
13 Correct 243 ms 140488 KB Output is correct
14 Correct 242 ms 140536 KB Output is correct
15 Correct 240 ms 140664 KB Output is correct
16 Correct 240 ms 140632 KB Output is correct
17 Correct 245 ms 140792 KB Output is correct
18 Correct 238 ms 140588 KB Output is correct
19 Correct 245 ms 140544 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 237 ms 140532 KB Output is correct
2 Correct 242 ms 140516 KB Output is correct
3 Correct 240 ms 140524 KB Output is correct
4 Correct 306 ms 142140 KB Output is correct
5 Correct 262 ms 141372 KB Output is correct
6 Correct 321 ms 142080 KB Output is correct
7 Correct 239 ms 140572 KB Output is correct
8 Correct 243 ms 140516 KB Output is correct
9 Correct 301 ms 142092 KB Output is correct
10 Correct 304 ms 142028 KB Output is correct
11 Correct 300 ms 142200 KB Output is correct
12 Correct 305 ms 142328 KB Output is correct
13 Correct 239 ms 140536 KB Output is correct
14 Correct 241 ms 140448 KB Output is correct
15 Correct 241 ms 140536 KB Output is correct
16 Correct 239 ms 140516 KB Output is correct
17 Correct 238 ms 140536 KB Output is correct
18 Correct 245 ms 140508 KB Output is correct
19 Correct 239 ms 140536 KB Output is correct
20 Correct 253 ms 140664 KB Output is correct
21 Correct 239 ms 140456 KB Output is correct
22 Correct 239 ms 140540 KB Output is correct
23 Correct 240 ms 140536 KB Output is correct
24 Correct 238 ms 140472 KB Output is correct
25 Correct 243 ms 140488 KB Output is correct
26 Correct 242 ms 140536 KB Output is correct
27 Correct 240 ms 140664 KB Output is correct
28 Correct 240 ms 140632 KB Output is correct
29 Correct 245 ms 140792 KB Output is correct
30 Correct 238 ms 140588 KB Output is correct
31 Correct 245 ms 140544 KB Output is correct
32 Correct 247 ms 140484 KB Output is correct
33 Correct 239 ms 140536 KB Output is correct
34 Correct 237 ms 140536 KB Output is correct
35 Correct 304 ms 142460 KB Output is correct
36 Correct 256 ms 141388 KB Output is correct
37 Correct 314 ms 142488 KB Output is correct
38 Correct 237 ms 140532 KB Output is correct
39 Correct 240 ms 140536 KB Output is correct
40 Correct 303 ms 142456 KB Output is correct
41 Correct 304 ms 142432 KB Output is correct
42 Correct 317 ms 142456 KB Output is correct
43 Correct 305 ms 142540 KB Output is correct
44 Correct 239 ms 140444 KB Output is correct
45 Correct 240 ms 140452 KB Output is correct
46 Correct 238 ms 140552 KB Output is correct
47 Correct 243 ms 140568 KB Output is correct
48 Correct 239 ms 140536 KB Output is correct
49 Correct 243 ms 140656 KB Output is correct
50 Correct 246 ms 140560 KB Output is correct
51 Correct 252 ms 140600 KB Output is correct
52 Correct 267 ms 140664 KB Output is correct
53 Correct 243 ms 140684 KB Output is correct
54 Correct 240 ms 140608 KB Output is correct
55 Correct 243 ms 140792 KB Output is correct
56 Correct 237 ms 140576 KB Output is correct
57 Correct 241 ms 140668 KB Output is correct
58 Correct 254 ms 141092 KB Output is correct
59 Correct 262 ms 141164 KB Output is correct
60 Correct 1084 ms 142456 KB Output is correct
61 Correct 320 ms 141188 KB Output is correct
62 Correct 306 ms 141248 KB Output is correct
63 Correct 822 ms 142844 KB Output is correct
64 Correct 284 ms 141256 KB Output is correct
65 Correct 869 ms 142780 KB Output is correct
66 Correct 342 ms 142796 KB Output is correct
67 Correct 510 ms 142764 KB Output is correct
68 Correct 325 ms 141176 KB Output is correct
69 Correct 237 ms 140664 KB Output is correct