#include <bits/stdc++.h>
#include "longesttrip.h"
//#include "grader.cpp"
using namespace std;
typedef long long ll;
vector<int> longest_trip(int n, int d)
{
    if(d == 3) {
        vector<int> ans(n);
        iota(ans.begin(),ans.end(),0);
        return ans;
    }
    vector<int> a;
    vector<int> b;
    vector<bool> rem(n,1);
    vector<int> ans;
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            if(!are_connected({i},{j})) {
                a.push_back(i);
                b.push_back(j);
                rem[i] = 0;
                rem[j] = 0;
            }
        }
    }
    for(auto i : a) ans.push_back(i);
    for(int i=0;i<n;i++) if(rem[i]) ans.push_back(i);
    for(auto i : b) ans.push_back(i);
    return ans;
}