Distances

#include "bits/stdc++.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

typedef long long ll;
const int mod = 1e9+7;
vector<vector<int>> adj, dist;
int cur;

void dfs(int u, int par) {
    for (int v : adj[u]) {
        if (v != par) {
            dist[cur][v] = dist[cur][u] + 1;
            dfs(v, u);
        }
    }
}

void solve(int tc) {
    int n;
    cin >> n;
    adj.clear();
    dist.clear();
    adj.resize(n);
    dist.resize(n);
    for (auto &x : dist) x.resize(n);
    for (int i = 1; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        --a, --b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    for (int i = 0; i < n; ++i) {
        cur = i;
        dfs(i, -1);
    }
    vector<int> v;
    for (int i = 0; i < n; ++i) v.push_back(i);
    do {
        bool con = false;
        for (int i = 0; i < n-1; ++i) {
            if (dist[i][i+1] > 3) {
                con = true;
                break;
            }
        }
        if (con) continue;
        for (int i = 0; i < n; ++i) cout << v[i] + 1 << " ";
        cout << '\n';
        return;
    } while (next_permutation(all(v)));
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED