Etäisyydet

#include<bits/stdc++.h>
using namespace std;

vector<int> graph[101010];
vector<int> graph2[101010];
int d[101][101];
int z[101][101];
int main(){
	int t;
	cin >> t;
	while(t--){
		for(int i = 0; i < 101; i++){
			graph[i] = {};
			graph2[i] = {};
			for(int j = 0; j < 101; j++){
				d[i][j] = 0;
				z[i][j] = 0;
			}
		}
		int n;
		cin >> n;
		for(int i = 0; i < n-1; i++){
			int a,b;
			cin >> a >> b;
			graph[a].push_back(b);
			graph[b].push_back(a);
		}
		for(int i = 1; i <= n; i++){
			z[i][i] = 1; 
			d[i][i] = 0;
			queue<int> q = {};
			q.push(i);
			while(!q.empty()){
				int s = q.front(); q.pop();
				for(auto u : graph[s]){
					if(z[i][u]) continue;
					z[i][u] = 1; d[i][u] = d[i][s] + 1;
					q.push(u);
				}
			}
		}
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++){
		//		cout << i << "," << j << ": " << d[i][j] << "\n";
			}
		}
		vector<int> ve = {};
		for(int i = 1; i <= n; i++){
			ve.push_back(i);
		}
		do{
			bool bo = false;
			for(int i = 1; i < n; i++){
				if(d[ve[i]][ve[i-1]] > 3){
					bo = true;
					break;
				}
			}
			if(!bo){
				for(auto u : ve){
					cout << u << " ";
				}
				cout << "\n";
				break;
			}
		} while(next_permutation(ve.begin(), ve.end()));
	}
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED