#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define sd second
#define debug(x) cerr << #x << "----> " << x << endl;
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("O3")
std::vector<int> longest_trip(int N, int D){
int n = N;
vector<vector<int>> v(n + 5);
vector<vector<bool>> edge(n + 5, vector<bool>(n + 5, false));
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
if(are_connected({i}, {j}));
v[i].pb(j);
v[j].pb(i);
edge[i][j] = edge[j][i] = true;
}
}
vector<int> ans;
for(int i = 0; i < n; i++) ans.pb(i);
return ans;
}
