| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 697441 | Deepesson | Cop and Robber (BOI14_coprobber) | C++17 | 1 ms | 464 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>
using namespace std;
#define MAX_N 500
// modify the following functions
// you can define global variables and functions
std::vector<int> con[MAX_N];
int start(int N, bool A[MAX_N][MAX_N]) {
    int count=0;
    for(int i=0;i!=N;++i){
        for(int j=0;j!=N;++j){
            if(i==j)continue;
            if(A[i][j])
            con[i].push_back(j);
        }
    }
    return 0;
}
int obj=0;
int dfs(int pos,int prev=-1){
    if(pos==obj){
        return pos;
    }
    for(auto&x:con[pos]){
        if(x==prev)continue;
        if(dfs(x,pos)){
            return x;
        }
    }
    return -1;
}
int atual=0,previi=-1;
int nextMove(int R) {
    obj=R;
    int strat = dfs(atual,previi);
    assert(strat!=-1);
    previi=atual;
    return atual=strat;
}
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... | ||||
