#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
pair<int,int> findedge(vector<int> a,vector<int> b)
{
int l=0,r=b.size()-1;
while(l!=r)
{
int s=(l+r)/2;
vector<int> q;
for(int i=l;i<=s;i++) q.push_back(b[i]);
if(are_connected(a,q)) r=s;
else l=s+1;
}
int ind=l;
vector<int> d;
d.push_back(b[l]);
l=0; r=a.size()-1;
while(l!=r)
{
int s=(l+r)/2;
vector<int> q;
for(int i=l;i<=s;i++) q.push_back(a[i]);
if(are_connected(q,d)) r=s;
else l=s+1;
}
return {l,ind};
}
mt19937 rng(time(0));
bool ask(int a,int b)
{
vector<int> a1,b1;
a1.push_back(a);
b1.push_back(b);
return are_connected(a1,b1);
}
std::vector<int> longest_trip(int N, int D)
{
vector<int> cur1,cur2;
vector<int> all;
for(int i=0;i<N;i++) all.push_back(i);
shuffle(all.begin(),all.end(),rng);
cur1.push_back(all[0]);
bool nema=true;
for(int i=1;i<N;i++)
{
int x=all[i];
if(ask(cur1.back(),x))
{
cur1.push_back(x);
nema=false;
if(cur2.size()==0) nema=true;
}
else
{
if(nema) cur2.push_back(x);
else
{
if(!ask(cur2.back(),x))
{
if(cur2.size()==1) nema=true;
else if(ask(cur2[0],x)) nema=true;
for(int i=cur2.size()-1;i>=0;i--) cur1.push_back(cur2[i]);
cur2.clear();
if(nema) cur2.push_back(x);
nema=true;
}
else
{
cur2.push_back(x);
nema=true;
}
}
}
}
if(cur1.size()<cur2.size()) return cur2;
return cur1;
}
