#include "game.h"
// author: yanybayev
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define pp pop_back
#define ll long long
#define pb push_back
#define ls(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define wr cout << "------------------------" << endl
const int INF = 1e9 + 7;
const int N = 3e5 + 5;
vector<int> g[N], gr[N];
int mx[N], mn[N];
int n, k;
void init(int N, int K) {
n = N, k = K;
for (int i = 0;i<n;++i) mx[i] = -INF, mn[i] = INF;
for (int i = 0;i<k;++i) mx[i] = mn[i] = i;
for (int i = 0;i<k - 1;++i) g[i].pb(i + 1), gr[i + 1].pb(i);
}
void dfs1(int nd, int val) {
mx[nd] = val;
for (auto it:g[nd]) {
if (mx[it] < val) dfs1(it, val);
}
}
void dfs2(int nd, int val) {
mn[nd] = val;
for (auto it:gr[nd]) {
if (mn[it] > val) dfs2(it, val);
}
}
int add_teleporter(int a, int b) {
g[a].pb(b);
gr[b].pb(a);
if (mx[a] > mx[b]) dfs1(b, mx[a]);
if (mn[b] < mn[a]) dfs2(a, mn[b]);
if (mx[a] >= mn[b]) return 1;
return 0;
}
