#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
std::vector<int> longest_trip(int n, int d)
{
vector<int> A;
vector<int> B;
A.push_back(0);
for (int i = 1; i < n; i++)
{
if(are_connected({i}, {A.back()})) A.push_back(i);
else if(B.size()==0 || are_connected({i}, {B.back()})) B.push_back(i);
else {
for (int x = B.size()-1; x >= 0; x--) A.push_back(B[x]);
B.clear();
}
}
if(A.size()<B.size()) swap(A,B);
vector<int> outp;
// teste les quatres boutssize
//back et back
if(B.size()==0) return A;
int aN=A.size(), bN=B.size();
if(are_connected({A[aN-1]}, {B[bN-1]})){
for (int i = 0; i < aN; i++) outp.push_back(A[i]);
for (int i = bN-1; i >= 0; i--) outp.push_back(B[i]);
}else if(are_connected({A[aN-1]}, {B[0]})){
for (int i = 0; i < aN; i++) outp.push_back(A[i]);
for (int i = 0; i < bN; i++) outp.push_back(B[i]);
}else if(are_connected({A[0]}, {B[bN-1]})){
for (int i = aN-1; i >= 0; i--) outp.push_back(A[i]);
for (int i = bN-1; i >= 0; i--) outp.push_back(B[i]);
}else if(are_connected({A[0]}, {B[0]})){
for (int i = aN-1; i >= 0; i--) outp.push_back(A[i]);
for (int i = 0; i < bN; i++) outp.push_back(B[i]);
}else{
int l=0, r=bN;
//check quelle de B vers A
while(l<r){
vector<int> conn;
int mid=((l+r-1)/2);
for (int i = l; i <= mid; i++) conn.push_back(B[i]);
if(are_connected({A}, {conn})){
r=mid;
}else{
l=mid+1;
}
}
if(l==bN) return A;
int connector=l;
l=0, r=aN;
//check quelle de B vers A
while(l<r){
vector<int> conn;
int mid=(l+r-1)/2;
for (int i = l; i <= mid; i++) conn.push_back(A[i]);
if(are_connected({B[connector]}, {conn})){
r=mid;
}else{
l=mid+1;
}
}
int aCount=0;
int i=l+1;
while (aCount<aN)
{
if(i==aN) i=0;
outp.push_back(A[i]);
i++;
aCount++;
}
int bCount=0;
i=connector;
while (bCount<bN)
{
if(i==bN) i=0;
outp.push_back(B[i]);
i++;
bCount++;
}
cout << "\n";
}
return outp;
}
