#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 map<vector<int>, map<vector<int>, int> > mmm; int query(vector<int> a, vector<int> b){ if (!mmm[a][b]&&!mmm[b][a])mmm[b][a]=mmm[a][b]=are_connected(a, b)+1; return mmm[a][b]-1; } vector<int> longest_trip(int n, int d){ mmm.clear(); 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> a(1, 0), b(1, 1); for (int i=2; i<n; ++i){ if (query({i}, {a.back()}))a.pb(i); else if (query({i}, {b.back()}))b.pb(i); else{ while (b.size())a.pb(b.back()), b.pop_back(); b.pb(i); } } if (b.size()>a.size())swap(a, b); if (query({a.back()}, {b.back()})){ while (b.size())a.pb(b.back()), b.pop_back(); } else if (query({a.back()}, {b[0]})){ for (auto c:b)a.pb(c); } else if (query({a[0]}, {b.back()})){ while (b.size())a.push_front(b.back()), b.pop_back(); } else if (query({a[0]}, {b[0]})){ for (auto c:b)a.push_front(c); } else{ for (int i=0; i<a.size(); ++i)for (int j=0; j<b.size(); ++j)if (query({a[i]}, {b[j]})){ vector<int> res; for (int p=0; p<a.size(); ++p)res.pb(a[(p+i+1)%a.size()]); for (int p=0; p<b.size(); ++p)res.pb(b[(p+j)%b.size()]); return res; } } vector<int> res; for (auto c:a)res.pb(c); return res; }