#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
#define pb push_back
#define fi first
#define se second
const int nax = 2e5+5;
const int MOD = 1e9+7;
vector<int> adj[256];
bool vis[256];
set<int> components[256];
vector<int> cur;
void dfs(int x){
cur.pb(x);
vis[x]=true;
for(auto u:adj[x]){
if(vis[u]) continue;
dfs(u);
return;
}
}
std::vector<int> longest_trip(int N, int D)
{
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].pb(j);
adj[j].pb(i);
}
}
}
int t=100;
vector<int> ans;
while(t--){
for (int i = 0; i < N; ++i)
{
vis[i]=0;
random_shuffle(adj[i].begin(),adj[i].end());
}
for (int i = 0; i < N; ++i)
{
if(vis[i]) continue;
cur.clear();
dfs(i);
if(ans.size()<cur.size()) ans=cur;
}
}
return ans;
}
