Distances

#include <bits/stdc++.h>
 
using namespace std;
 
#define int long long
#define ff first
#define ss second
#define pb push_back
 
const int N = 2e5 + 5, inf = 1e18 + 100;
 
int n, d[15][15], a[15];
vector < int > g[15];
 
void dickstra(int s)
{
    for (int i = 1; i <= n; ++i)
        d[s][i] = inf;
    d[s][s] = 0;
 
    set < pair < int, int > > q;
    q.insert({0, s});
    while (q.size())
    {
        int v = q.begin() -> ss;
        q.erase(q.begin());
        for (int to : g[v])
        {
            if (d[s][v] + 1 < d[s][to])
            {
                q.erase({d[s][to], to});
                d[s][to] = d[s][v] + 1;
                q.insert({d[s][to], to});
            }
        }
    }
}
 
void solve()
{
    cin >> n;
 
    for (int i = 1; i <= n; ++i)
    {
        g[i].clear();
        for (int j = 1; j <= n; ++j)
            d[i][j] = 0;
    }
 
    for (int i = 1; i < n; ++i)
    {
        int u, v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }
 
    for (int i = 1; i <= n; ++i)
        dickstra(i), a[i] = n - i + 1;
 
    int k = 1;
    for (int i = 2; i <= n; ++i)
        k *= i;
 
    while (k > 0)
    {
        next_permutation(a + 1, a + n + 1);
        k--;
 
        int ok = 1;
        for (int i = 2; i <= n; ++i)
            if (d[a[i - 1]][a[i]] > 3) {ok = 0; break;}
 
        if (ok)
        {
            for (int i = 1; i <= n; ++i)
                cout << a[i] << ' ';
            cout << '\n';
            return;
        }
    }
}
 
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int q;
    cin >> q;
    while (q--)
        solve();
    return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: RUNTIME ERROR