#include "longesttrip.h"
#include <bits/stdc++.h>
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repa(a,b) for(auto a:b)
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define pf push_front
#define fi first
#define se second
using namespace std;
vector<int> longest_trip(int N, int D){
deque<vector<int>> ans;
rep(i,0,N){
ans.pb({i});
}
while(ans.size()>1){
if(are_connected({ans[0].back()},{ans[1].back()})){
repa(e,ans[1]) ans[0].pb(e);
ans.erase(ans.begin()+1);
}else if(are_connected({ans[0].back()},{ans[1].back()})){
repa(e,ans[2]) ans[0].pb(e);
ans.erase(ans.begin()+2);
}else{
repa(e,ans[2]) ans[1].pb(e);
ans.erase(ans.begin()+2);
}
}
if(ans[0].size()>ans[1].size()) return ans[0];
else return ans[1];
}
