Distances

input/code.cpp: In function 'int main()':
input/code.cpp:95:13: warning: 'v' may be used uninitialized in this function [-Wmaybe-uninitialized]
         dfs1(v, v);
         ~~~~^~~~~~

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize ("trapv")
//#pragma GCC optimize ("O3")
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,avx,sse4.1,sse4.2,mmx")

typedef long long ll;
#define ff first
#define what(x) cerr << #x << " = " << x << '\n'
#define ss second
#define pb push_back
#define ld long double
#define ins insert
#define boost ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define MOD 1000000007

using namespace std;

mt19937_64 mt_rnd_64(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l, int r){
    return mt_rnd_64() % (r - l + 1) + l;
}

using namespace __gnu_pbds;

template<class T>
using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

template<class T>
using ordered_multiset=tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;

const ll N = 200 + 10;
const ll inf = 1e18 + 10;

vector <ll> g[N];
ll d[N];

void dfs(ll v, ll p, ll cnt)
{
    d[v] = cnt;
    for (auto to : g[v])
    {
        if (to != p)
        {
            dfs(to, v, cnt + 1);
        }
    }
}

void dfs1(ll v, ll p)
{
    cout << v << ' ';
    for (auto to : g[v])
    {
        if (to != p)
        {
            dfs1(to, v);
        }
    }
}

signed main()
{
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    ll q;
    cin >> q;
    while (q--)
    {
        ll n;
        cin >> n;
        for (ll i = 1; i <= n; ++i) g[i].clear();
        for (ll i = 1; i < n; ++i)
        {
            ll x, y;
            cin >> x >> y;
            g[x].pb(y);
            g[y].pb(x);
        }
        dfs(1, 1, 0);
        ll mx = -inf;
        ll v;
        for (ll i = 1; i <= n; ++i)
        {
            if (d[i] > mx)
            {
                mx = d[i];
                v = i;
            }
        }
        dfs1(v, v);
        cout << '\n';
    }




    return 0;
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER