#include "longesttrip.h" #include <bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair #define pii pair<int, int> #define fi first #define se second vector<int> longest_trip(int n, int d){ if (d==3){ vector<int> ans; for (int i=0; i<n; ++i)ans.pb(i); return ans; } if (d==2){ deque<int> ans(1, 0); int done=1; if (are_connected({0}, {1}))ans.pb(1); else ans.pb(2), done=2; for (int i=1; i<n; ++i)if (i!=done){ if (are_connected({i}, {ans.back()}))ans.pb(i); else ans.push_front(i); } vector<int> res; for (auto a:ans)res.pb(a); return res; } deque<int> ans(1, 0); set<int> s; for (int i=1; i<n; ++i)s.insert(i); int loop=256; while (loop--){ vector<int> temp; for (int i:s){ if (are_connected({i}, {ans.back()}))ans.pb(i), temp.pb(i); else if (are_connected({i}, {ans[0]}))ans.push_front(i), temp.pb(i); } for (auto a:temp)s.erase(a); } vector<int> res; for (auto a:ans)res.pb(a); return res; }