Distances

///By Stephan Ramirez dsramirezc@unal.edu.co
#include<bits/stdc++.h>
#define ms(a,v) memset(a,v,sizeof a)
#define ll long long
#define N 110
using namespace std;
int T;
int n;
vector<int> adj[N];
vector<int> adj1[N];
bool vis[N];
int cur=0;
int cnt=0;
void md(int node,int parent,int d){
	adj[cur].push_back(node);
	if(d==3)
		return ;
	for(int i : adj1[node])
		if(i!=parent)
			md(i,node,d+1);
	

}
vector<int> ans;
void bk(){
	if(cnt==n)
		return;
	int last=cur;
	for(int i : adj[cur])	{
		if(!vis[i]){
			cur=i;
			cnt++;
			vis[i]=true;
			ans.push_back(i);
			bk();
			if(cnt==n)
				return ;
			vis[i]=false;
			cur=last;
			cnt--;
			ans.pop_back();
		}

	}
	cur=last;
}
int main(){
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	#ifdef LOCAL
		freopen("in.txt","r",stdin);
		//freopen("out.txt","w",stdout)	;
	#endif
	cin>>T;
	while(T--){
		cin>>n;
		for(int i=1;i<=n;i++){
			adj[i].clear();
			adj1[i].clear();
			vis[i]=false;
		}
		ans.clear();
		for(int i=0;i<n-1;i++){
			int a,b;
			cin>>a>>b;
			adj1[a].push_back(b);
			adj1[b].push_back(a);
		}
		for(int i=1;i<=n;i++){
			cur=i;
			md(i,-1,0);
		}
		cur=1;
		cnt=1;
		ans.push_back(1);
		vis[1]=true;
		bk();
		for(int i : ans)
			cout<<i<<" ";
		cout<<"\n"; 
						
	}
	return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED