# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
567670 | zaneyu | Cop and Robber (BOI14_coprobber) | C++14 | 0 ms | 292 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"
#define REP(i,n) for(int i=0;i<n;i++)
int start(int n, bool A[MAX_N][MAX_N])
{
int c;
REP(i,n) if(A[0][i]) c=i;
int r=n/c;
if(r==2 or c==2){
return 0;
}
return -1;
}
int nextMove(int R){
if(R==3) return 0;
return R;
}
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... |