#include "park.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
struct pair_hash{
size_t operator()(const pair<int,int>&x)const{
return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
}
};
const int MAXN = 1505;
vi child[MAXN];
int vis[MAXN];
int f[MAXN];
static int p[MAXN];
vi curr;
int n;
bool neighbour(int a, int b){
for(int i = 0; i < n; i++){
p[i] = 0;
}
p[a] = p[b] = 1;
return Ask(a, b, p);
}
void dfs(int v, int p){
vis[v] = 1;
if(v != p){
curr.pb(v);
}
for(auto u : child[v]){
if(!vis[u]){
dfs(u, v);
}
}
}
bool check(int a, int b, int k){
for(int i = 0; i < n; i++){
p[i] = 0;
}
p[a] = p[b] = 1;
for(int i = 0; i <= k; i++){
p[curr[i]] = 1;
}
return Ask(a, b, p);
}
void merge(int a, int b){
if(f[b]){
return;
}
if(neighbour(a, b)){
f[b] = 1;
child[a].pb(b);
return;
}
curr.clear();
for(int i = 0; i < n; i++){
vis[i] = 0;
}
dfs(a, a);
for(int i = 0; i < n; i++){
if(i == a || i == b){
continue;
}
if(!vis[i]){
curr.pb(i);
}
}
int l = 0;
int p = sz(curr) - 1;
int mid;
while(l < p){
mid = (l + p) / 2;
if(check(a, b, mid)){
p = mid;
}else{
l = mid + 1;
}
}
merge(a, curr[l]);
merge(curr[l], b);
}
void Detect(int T, int N){
n = N;
for(int i = 1; i < n; i++){
merge(0, i);
}
for(int i = 0; i < n; i++){
for(auto u : child[i]){
Answer(i, u);
}
}
}
