# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
398864 | almothana05 | Cop and Robber (BOI14_coprobber) | C++14 | 3 ms | 4172 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<iostream>
#include<vector>
using namespace std;
int menge = 0 , jet = 0;
vector<vector<bool> >num;
vector<int>vis(1000000 , 0);
int start(int N, bool A[MAX_N][MAX_N])
{
for(int i = 0 ;i < N ; i++){
num.push_back(vector<bool>());
for(int j = 0 ; j < N ; j++){
num[i].push_back(A[i][j]);
}
}
menge = N;
return 0;
}
int nextMove(int R)
{
if(num[jet][R] == 1){
return R;
}
else{
for(int i = 0 ; i < menge ; i++){
if(vis[i] == 0){
vis[i] = 1;
return i;
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |