#include "game.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
namespace{
const int inf=1e9;
vector<int> l,r,lev;
int k;
vector<vector<int>> adj,adjr;
}
void init(int n, int _k) {
k=_k;
l=vector<int>(n+1,k+1);
r=vector<int>(n+1,0);
lev=vector<int>(n+1,20);
adj.resize(n+1);
adjr.resize(n+1);
for(int i=1;i<=k;i++){
if(i>1){
r[i]=i-1;
}
if(i<k){
l[i]=i+1;
}
}
}
int add_teleporter(int a, int b) {
a++;
b++;
adj[a].push_back(b);
adjr[b].push_back(a);
{
int tmp=l[b];
if(b<=k) tmp=min(tmp,b);
l[a]=min(l[a],tmp);
}
{
int tmp=r[a];
if(a<=k) tmp=max(tmp,a);
r[b]=max(r[b],tmp);
}
if(l[a]<=r[a] or l[b]<=r[b]) return 1;
queue<int> q;
{
bool tf=false;
while(lev[a]>=0 and (l[a]>>lev[a])==(r[a]>>lev[a])){
lev[a]--;
tf=true;
}
if(tf) q.push(a);
}
{
bool tf=false;
while(lev[b]>=0 and (l[b]>>lev[b])==(r[b]>>lev[b])){
lev[b]--;
tf=true;
}
if(tf) q.push(b);
}
while(!q.empty()){
int v=q.front();
q.pop();
if(l[v]<=r[v]) return 1;
for(auto u:adjr[v]){
if(l[v]<l[u]){
l[u]=l[v];
if(l[u]<=r[u]) return 1;
bool tf=false;
while(lev[u]>=0 and (l[u]>>lev[u])==(r[u]>>lev[u])){
lev[u]--;
tf=true;
}
if(tf) q.push(u);
}
}
for(auto u:adj[v]){
if(r[v]>r[u]){
r[u]=r[v];
if(l[u]<=r[u]) return 1;
bool tf=false;
while(lev[u]>=0 and (l[u]>>lev[u])==(r[u]>>lev[u])){
lev[u]--;
tf=true;
}
if(tf) q.push(u);
}
}
}
return 0;
}
/*
50 36 11
47 17
36 20
49 11
19 15
25 17
10 17
26 28
49 21
5 44
30 3
20 36
45 13
35 24
8 32
48 22
11 40
26 47
18 38
7 46
18 7
17 29
47 3
18 37
2 49
40 4
29 30
49 25
29 23
9 12
16 44
10 28
1 3
43 49
6 29
47 26
44 41
*/
