#include <bits/stdc++.h>
#include "game.h"
using namespace std;
const int mxN = 1055;
vector <int> adj[mxN];
int vis[mxN], visiting[mxN], N, K;
bool dfs (int u = 0, int par = 0, int c = 0) {
if (vis[u]) return 0;
if (visiting[u] != -1) {
return (c - visiting[u]) > 0;
}
visiting[u] = c;
if (u <= K) c += 1;
for (auto v : adj[u]) {
if (!vis[v]) {
if (dfs(v, u, c)) {
return 1;
}
}
}
vis[u] = 1;
return 0;
}
void init (int n, int k) {
N = n, K = k;
for (int i = 0; i < k - 1; ++i) {
adj[i].push_back(i + 1);
}
}
int add_teleporter (int u, int v) {
for (int i = 0; i < N; ++i) vis[i] = 0, visiting[i] = -1;
adj[u].push_back(v);
return dfs();
}
