#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
//bool are_connected(std::vector<int> A, std::vector<int> B);
bool sor(int x, int y){
std::vector<int> ilk;
std::vector<int> iki;
ilk.push_back(x);
iki.push_back(y);
return are_connected(ilk,iki);
}
std::vector<int> longest_trip(int N, int D)
{
vector<vector<int>> arr(N);
for (int i = 0; i < N; i++){
arr[i].push_back(i);
}
while (arr.size()>2){
if (sor(arr[0].back(),arr[1][0])){
for (auto it : arr[1]){
arr[0].push_back(it);
}
swap(arr[1],arr.back());
arr.pop_back();
}
else if (sor(arr[0].back(),arr[2][0])){
for (auto it : arr[2]){
arr[0].push_back(it);
}
swap(arr[2],arr.back());
arr.pop_back();
}
else{
reverse(arr[1].begin(), arr[1].end());
for (auto it : arr[2]){
arr[1].push_back(it);
}
swap(arr[2],arr.back());
arr.pop_back();
}
}
if (arr[0].size()>arr[1].size()) return arr[0];
return arr[1];
}
