#include"longesttrip.h"
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#define N 256
using namespace std;
int n,lg[N+1];
bool check(int x,int y)
{
	return are_connected({x},{y});
}
bool check2(vector<int>p,int d,int x)
{
	vector<int>q;
	for (int i=d;i<p.size();++i) q.push_back(p[i]);
	return are_connected(q,{x});
}
bool check3(vector<int>p,int d,int x)
{
	vector<int>q;
	for (int i=0;i<=d;++i) q.push_back(p[i]);
	return are_connected(q,{x});
}
vector<int>longest_trip(int SN, int D)
{
	vector<int>p;
	vector<int>p2;
	vector<int>q;
	int x;
	n=SN;
	for (int i=2;i<=N;++i) lg[i]=lg[i>>1]+1;
    if (D==3)
	{
		for (int i=0;i<n;++i) p.push_back(i);
		return p;
	}
	else if (D==2)
	{
		if (!check(0,1)) p.push_back(0),p.push_back(2),p.push_back(1);
		else if (!check(0,2)) p.push_back(0),p.push_back(1),p.push_back(2);
		else p.push_back(1),p.push_back(0),p.push_back(2);
		for (int i=3;i<n;++i)
		{
			if (!check(p.back(),i)) reverse(p.begin(),p.end());
			p.push_back(i);
		}
		return p;
	}
	else
	{
		p.push_back(0);
		for (int i=1;i<n;++i)
		{
			if (p2.empty())
			{
				if (!are_connected(p,{i})) p2.push_back(i);
				else
				{
					if (check(p.back(),{i})) p.push_back(i);
					else if (check(p[0],{i})) reverse(p.begin(),p.end()),p.push_back(i);
					else
					{
						x=p.size()-1,q.clear();
						for (int j=lg[p.size()];j>=0;--j)
							if (x-(1<<j)>=1&&!check2(p,x-(1<<j),i))
								x-=(1<<j);
						x--;
						for (int j=(int)(p.size())-1;j>=x+1;--j) q.push_back(p[j]);
						for (int j=0;j<=x;++j) q.push_back(p[j]);
						q.push_back(i),p=q;
					}
				}
			}
			else
			{
				if (!are_connected(p,{i})) p2.push_back(i);
				else if (!are_connected(p2,{i})) p.push_back(i);
				else
				{
					x=-1,q.clear();
					for (int j=lg[p.size()];j>=0;--j)
						if (x+(1<<j)+1<p.size()&&!check3(p,x+(1<<j),i))
							x+=(1<<j);
					x++;
					for (int j=0;j<p.size();++j)
						if (j!=x)
							q.push_back(p[j]);
					q.push_back(p[x]),q.push_back(i),x=-1;
					for (int j=lg[p2.size()];j>=0;--j)
						if (x+(1<<j)+1<p2.size()&&!check3(p2,x+(1<<j),i))
							x+=(1<<j);
					x++,q.push_back(p2[x]);
					for (int j=0;j<p2.size();++j)
						if (j!=x)
							q.push_back(p2[j]);
					p=q,p2.clear();
				}
			}
		}
		if (p.size()<p2.size()) swap(p,p2);
		return p;
	}
}