#include <bits/stdc++.h> #include "longesttrip.h" using namespace std; using ll = long long; int n; vector<int> longest_trip(int N, int D) { n = N; vector<int> p1, p2; p1.push_back(0); for (int i = 1;i < n;i++) { if (are_connected({ p1.back() }, { i })) p1.push_back(i); else { p2.push_back(i); break; } } if ((int)p1.size() == n) return p1; for (int i = p2.back() + 1;i < n;i++) { if (are_connected({ p1.back() }, { p2.back(), i })) { p1.push_back(i); } else { p2.push_back(i); } } if (p1.size() > p2.size()) return p1; return p2; }