Distances

#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
using namespace std;
 
int dist[101][101], e[101];
bitset<101> done,col;
 
void solve()
{
    int n,x,y;
    cin>>n;
    for (int i=1;i<=n;++i)
    {
        for (int j=1;j<=n;++j)
            dist[i][j]=200;
        dist[i][i]=e[i]=0;
        done[i]=col[i]=0;
    }
    for (int i=1;i<n;++i)
    {
        cin>>x>>y;
        dist[x][y]=1;
        dist[y][x]=1;
        ++e[x];
        ++e[y];
    }
    for (int k = 1; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
    for (int i=1;i<=n;++i)
        if (e[i]==1)
            x=i;
    for (int i=1;i<=n;++i)
        if (dist[1][i]&1)
            col[i]=1;
    vector<int> v;
    v.push_back(x);
    bool ok;
    while (1)
    {
        x=v.back();
        done[x]=1;
        ok=1;
        cout<<x<<" ";
        for (int i=1;i<=n&&ok;++i)
            if (dist[x][i]<4&&!done[i]&&col[i])
            {
                ok=0;
                v.push_back(i);
                break;
            }
        for (int i=1;i<=n&&ok;++i)
            if (dist[x][i]==2&&!done[i])
            {
                ok=0;
                v.push_back(i);
                break;
            }
        for (int i=1;i<=n&&ok;++i)
            if (dist[x][i]==3&&!done[i])
            {
                ok=0;
                v.push_back(i);
                break;
            }
        for (int i=1;i<=n&&ok;++i)
            if (dist[x][i]==1&&!done[i])
            {
                ok=0;
                v.push_back(i);
                break;
            }
        if (ok)
            break;
    }
    cout<<"\n";
}
 
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n;
    cin>>n;
    while (n--)
        solve();
    return 0;
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER