#include <bits/stdc++.h>
#include "coprobber.h"
using namespace std;
#define pb push_back
#define ll long long
//#define int long long
const ll mod=998244353;
const int mxsz=5e2;
const ll inf = LLONG_MAX;
vector<int> adj[mxsz];
int vis[mxsz];
bool ch[mxsz];
bool b=0;
int cur=0;
void dfs(int i,int X){
vis[i]=1;
for (auto x:adj[i]){
if (!vis[x]){
if (x==X)b=1;
ch[x]=b;
dfs(x,X);
}
}
}
int start(int n,bool a[mxsz][mxsz]){
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 X){
for (int i=0;i<mxsz;i++){
vis[i]=0;
ch[i]=0;
}b=0;
dfs(cur,X);
for (auto x:adj[cur]){
if (ch[x])cur=x;
}
return cur;
}
# | 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... |