# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155438 | oolimry | 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;
static int states[500005]; //police * 1000 + robber * 2 + (IF POLICE TURN)
static int degree[500005];
static int to[500005];
static vector<int> rev[500005];
queue<int> can;
inline int g(int police, int robber, int turn){
return police * 1000 + robber * 2 + turn;
}
int pos;
int start(int N, bool A[MAX_N][MAX_N])
{
int n = N;
for(int u = 0;u < n;u++){
for(int v = 0;v < n;v++){
int s = g(u,v,0);
rev[s+1].push_back(s); //Wait
degree[s]++;
for(int i = 0;i < n;i++){
if(A[u][i] == 1){
rev[g(i,v,1)].push_back(s);
degree[s]++;
}
if(A[v][i] == 1){
rev[g(u,i,0)].push_back(s+1);
degree[s+1]++;
}
}
if(u == v){
states[s] = 1;
states[s+1] = 1;
}
}
}
for(int i = 0;i < 500005;i++){
if(states[i] == 1){
can.push(i);
degree[i] = 0;
}
}
int work[n];
fill(work,work+n,n);
while(!can.empty()){
int t = can.front();
//cout << t << "\n";
if(!(t&1)){
work[t/1000]--;
if(work[t/1000] == 0){
pos = t/1000;
return t/1000;
}
}
can.pop();
for(int i = 0;i < rev[t].size();i++){
int s = rev[t][i];
if(states[s] == 0){
degree[s]--;
//cout << t << " " << s << " " << degree[s] << "\n";
if(!(s & 1)){
can.push(s);
states[s] = 1;
degree[s] = 0;
to[s] = t;
//cout << s << " " << t << "\n";
}
else if(degree[s] == 0){
can.push(s);
states[s] = 1;
}
}
}
}
return -1;
}