# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
691874 | Abito | Game (APIO22_game) | C++17 | 0 ms | 0 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 "game.h"
const int N=1e5+5;
int n,k;
bool h=0,vis[N];
vector<int> adj[N];
void dfs(int node){
vis[node]=true;
for (auto u:adj[node]){
if (vis[u]){
h=1;
break;
}
dfs(u);
}
return;
}
void init(int nn, int kk) {
n=nn;kk;
return;
}
int add_teleporter(int u, int v) {
adj[u].pb(v);
adj[b].pb(u);
if (h) return h;
for (int i=1;i<=n;i++) vis[i]=false;
dfs(1);
return h;
}