#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[300];
vector<int> res, cur;
bool vis[300];
void dfs(int u){
if(res.size() < cur.size()) res = cur;
for(int v : adj[u]){
if(vis[v]) continue;
vis[v] = 1;
cur.push_back(v);
dfs(v);
vis[v] = 0;
cur.pop_back();
}
}
std::vector<int> longest_trip(int N, int D)
{
res.clear();
for(int i = 0; i < N; ++i) adj[i].clear();
for(int i = 0; i < N; ++i){
for(int j = i+1; j < N; ++j){
if(are_connected({i}, {j})){
adj[i].push_back(j);
adj[j].push_back(i);
}
}
}
for(int i = 0; i < N; ++i){
memset(vis, 0, sizeof vis);
cur.clear();
dfs(i);
}
return res;
}
