#include "game.h"
#include <bits/stdc++.h>
#define int long long
#define emb emplace_back
#define pii pair <int32_t, int32_t>
#define tiii tuple <int32_t, int32_t, int32_t>
#define all(a) a.begin(), a.end()
using namespace std;
const int N = 1e5 + 5;
const int inf = 1e18;
int n, k;
vector <int> adj[N], radj[N];
bool visited[N];
int mx[N], mn[N];
int idx = 0;
void init(int32_t nn, int32_t kk) {
n = nn;
k = kk;
for (int i = 1; i <= n; i++) mx[i] = -inf, mn[i] = inf;
for (int i = 1; i <= k; i++) mx[i] = mn[i] = i;
for (int i = 1; i < k; i++) adj[i].emb(i + 1), radj[i + 1].emb(i);
}
void dfs1(int u, int val){
visited[u] = idx;
mx[u] = max(mx[u], val);
for (auto v : adj[u]) {
if (visited[v] == idx) continue;
if (val > mx[v]) dfs1(v, val);
}
}
void dfs2(int u, int val){
visited[u] = idx;
mn[u] = min(mn[u], val);
for (auto v : radj[u]) {
if (visited[v] == idx) continue;
if (val < mn[v]) dfs2(v, val);
}
}
int32_t add_teleporter(int32_t u, int32_t v) {
u++, v++;
adj[u].emb(v);
radj[v].emb(u);
idx++;
if (mx[u] > mx[v]) dfs1(v, mx[u]);
idx++;
if (mn[v] < mn[u]) dfs2(u, mn[v]);
// for (int i = 1; i <= n; i++) {
// cout << i << " : " << mn[i] << ", " << mx[i] << "\n";
// }
// cout << "-------------------\n";
// cout << u << " -> " << v << " :: " << k << "\n";
if ((u > k && mx[u] >= mn[u]) || (v > k && mx[v] >= mn[v]) || (u == v && u <= k)) return 1;
return 0;
}
