#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> adj[501];
bool in[501];
int go[501],crnt=0;
void dfs(int node,int par,int goal){
    if(node==goal){
        in[node]=1;
        return;
    }
    for(auto i:adj[node]){
        if(i==par)continue;
        dfs(i,node,goal);
        if(in[i]){
            go[node]=i;
            in[node]=1;
        }
    }
}
int start(int N, bool A[MAX_N][MAX_N])
{
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++){
            if(A[i][j])adj[i].pb(j);
        }
    }
    return 0;
}
int nextMove(int R)
{
    for(int i=0;i<501;i++)in[i]=0;
    dfs(crnt,-1,R);
    crnt=go[crnt];
    return crnt;
}
| # | 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... |