#define _CRT_SECURE_NO_WARNINGS
#include "longesttrip.h"
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <map>
#include <stack>
#include <set>
#include <queue>
#include <deque>
#include <unordered_set>
#include <unordered_map>
#include <math.h>
#include <cmath>
#include <vector>
#include <iomanip>
#include <random>
#include <chrono>
#include <bitset>
#include <cassert>
using namespace std;
#define ll long long
#define fr first
#define sc second
#define pb push_back
#define US freopen(".in", "r", stdin); freopen(".out", "w", stdout);
ll gcd(ll a, ll b)
{
if (a == 0 || b == 0) {
return max(a, b);
}
if (a <= b) {
return gcd(a, b % a);
}
else {
return gcd(a % b, b);
}
}
ll lcm(ll a, ll b) {
return (a / gcd(a, b)) * b;
}
const int N = 500005;
const ll oo = 1000000000000000000, MOD = 1000000007;
vector<int> patas, g[N];
bool ok[N];
void dfs(int u) {
ok[u] = 1;
patas.pb(u);
for (int num : g[u]){
if (ok[num] == 0) {
dfs(num);
}
}
}
std::vector<int> longest_trip(int N, int D)
{
int n = N, d = D;
for (int i = 0; i < n; ++i) {
ok[i] = 0;
g[i].clear();
}
patas.clear();
vector<int> vec;
if (d == 3) {
for (int i = 0; i < n; ++i) {
vec.pb(i);
}
return vec;
}
if (d == 2) {
int sk1 = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (are_connected({ i }, { j })==1){
g[i].pb(j);
g[j].pb(i);
}
else {
sk1 = 0;
}
}
}
dfs(sk1);
return patas;
}
return {};
}
