| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 136029 | forelax | Cop and Robber (BOI14_coprobber) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "coprobber.h"
#include<bits/stdc++.h>
using namespace std;
vector<vector<bool> > wing(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;
queue<vector<int> > q;
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.push({0,i,j});
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]=edge[j].size();
if(a[j][i])cntl[i][j]--;
if(cntl[i][j])continue;
q.push({1,y,ne});
}
}
while(q.size()){
vector<int> nw=q.front();
q.pop();
int x=nw[2];
int y=nw[1];
int st=nw[0];
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.push({1,y,ne});
}
}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.push({0,ne,x});
}
}
}
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;
//}