Distances

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

#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double

const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;

vector<int> adj[MAXN];
vector<pair<int, int>> mem[2];
bool vis[MAXN];

void dfs(int s, int curr, int dist, int p){
    vis[s] = true;
    mem[curr].pb({dist, s});
    for(auto u: adj[s]){
        if(!vis[u] && u != p){
            dfs(u, curr^1, dist+1, s);
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #endif
    int t;
    cin>>t;
    while(t--){
    	int n;
    	cin>>n;
    	for(int i= 0;i<=n+1;i++){
    		adj[i].clear();
            vis[i] = 0;
    	}
    	for(int i= 0;i<n-1;i++){
    		int t1, t2;
    		cin>>t1>>t2;
    		adj[t1].pb(t2);
    		adj[t2].pb(t1);
    	}
        cout<<1<<' ';
        for(int v: adj[1]){
            mem[0].clear();
            mem[1].clear();
            dfs(v, 0, 0, 1);
            sort(all(mem[0]));
            reverse(all(mem[0]));
            sort(all(mem[1]));
            for(auto it: mem[1]){
                cout<<it.sc<<' ';
            }
            for(auto it: mem[0]){
                cout<<it.sc<<' ';
            }
        }
        cout<<endl;
    }

    return 0;
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER