#include "game.h"
#include <cmath>
#include <functional>
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <cassert>
#include <bitset>
#include <sstream>
#include <chrono>
#include <cstring>
#include <numeric>
using namespace std;
const int INF = (int)1e9 + 7;
int rad;
int getbucket(int x)
{
return x / rad;
}
int n, k;
vector<vector<int>> g, ig;
vector<int> mn, mn2,isprec;
bool is;
void addedge(int from, int to)
{
isprec[from] |= isprec[to];
g[from].push_back(to);
ig[to].push_back(from);
}
void init(int nn, int kk)
{
is = 0;
n = nn;
k = kk;
rad = sqrt(n) + 2;
g.clear();
g.resize(n);
ig.clear();
ig.resize(n);
mn.clear();
mn.resize(n, +INF);
mn2.clear();
mn2.resize(n, +INF);
isprec.clear();
isprec.resize(n, 0);
for (int i = 0; i + 1 < k; i++)
{
//addedge(i, i + 1);
}
}
void toggle(int a)
{
}
void upd(int a, int value, int esteprec)
{
if (is)
{
return;
}
assert(esteprec == 0 || esteprec == 1);
if (esteprec == 1)
{
//if (!isprec[a] && a >= k) return;
if (value < mn[a])
{
mn[a] = value;
if (a < k && mn[a] <= a)
{
is = 1;
return;
}
for (auto& b : ig[a])
{
upd(b, mn[a], 1);
}
}
return;
}
assert(esteprec == 0);
if (value < mn2[a])
{
mn2[a] = value;
for (auto& b : ig[a])
{
upd(b, mn2[a], 0);
}
if (a < k)
{
if (mn2[a] < getbucket(a))
{
is = 1;
return;
}
if (mn2[a] == getbucket(a))
{
return;
isprec[a] = 1;
for (auto& b : g[a])
{
//cout << "a = " << a << " : " << b << "\n";
if (b < k)
{
upd(a, b, 1);
}
else
{
upd(a, mn[b], 1);
}
}
}
}
}
}
int add_teleporter(int from, int to)
{
addedge(from, to);
if (to < k)
{
upd(from, to, 1);
upd(from, getbucket(to), 0);
}
else
{
upd(from, mn[to], 1);
upd(from, mn2[to], 0);
}
//cout << "finished adding " << from << " " << to << "\n";
if (is)
{
return 1;
}
for (int i = 0; i < n; i++)
{
if (mn[i] != INF)
{
//cout << i << " : " << getbucket(mn[i]) << " vs " << mn2[i] << "\n";
assert(mn2[i] == getbucket(mn[i]));
}
}
return 0;
}
