#include "longesttrip.h" #include<bits/stdc++.h> #define pb push_back #define all(a) (a).begin(), (a).end() using namespace std; vector<int> longest_trip(int n, int D) { if(D == 3) { vector<int> p; for(int i = 0;i < n;i++) p.pb(i); return p; } if(D == 2) { deque<int> dq; if(!are_connected({0}, {1})) dq.pb(0), dq.pb(2), dq.pb(1); else if(!are_connected({1}, {2})) dq.pb(1), dq.pb(0), dq.pb(2); else dq.pb(0), dq.pb(1), dq.pb(2); for(int i = 3;i < n;i++) { if(are_connected({i}, {dq.front()})) dq.push_front(i); else dq.pb(i); } return vector<int>(all(dq)); } return {}; }