# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107598 | patrikpavic2 | Cop and Robber (BOI14_coprobber) | C++17 | 2 ms | 640 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 <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
int mv = 0, pos, n, m;
bool a[MAX_N][MAX_N];
int start(int N, bool A[MAX_N][MAX_N]){
for(int i = 0;i < MAX_N;i++){
for(int j = 0;j < MAX_N;j++){
a[i][j] = A[i][j];
}
}
m = 0;
while(A[m][m + 1]) m++;m++;
n = N / m;
if(n <= 3 && m <= 3){
if(n == 3 && m == 3)
return pos = 4;
return pos = 1;
}
else if(n == 2 || m == 2){
if(n == 2) return pos = m / 2;
return pos = n / 2;
}
return -1;
}
int nextMove(int R){
if(a[R][pos]) return R;
if(n <= 3 && m <= 3) return pos;
if(n == 2){
int r = R % m;
int p = pos % m;
if(p < r) return pos = pos + 1;
return pos = pos - 1;
}
if(m == 2){
int r = R / 2;
int p = pos / 2;
if(p < r) return pos = pos + 2;
return pos = pos - 2;
}
}
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... |