# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
398855 | almothana05 | 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"
int menge = 0 , jet = 0;
vector<vector<bool> >num;
int start(int N, bool A[MAX_N][MAX_N])
{
for(int i = 0 ;i < N ; i++){
num.push_back(vector<int>());
for(int j = 0 ; j < N ; j++){
num[i].push_back(A[i][j]);
}
}
menge = N;
return 0;
}
int nextMove(int R)
{
if(A[jet][R] == 1){
return R;
}
else{
return jet;
}
}