| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1119855 | PagodePaiva | Cop and Robber (BOI14_coprobber) | C++17 | 1 ms | 336 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<bits/stdc++.h>
#include "coprobber.h"
int eu = 0;
int start(int N, bool A[MAX_N][MAX_N]){
int cnt = 0;
for(int i = 1;i < N;i++){
if(A[0][i]) cnt++;
}
return (cnt > 1 ? -1 : 0);
}
int nextMove(int R){
eu++;
return eu;
}| # | 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... | ||||
