Etäisyydet

#include <bits/stdc++.h>

using namespace std;

#define N 101

int t;
vector<int> v[N];
int z[N];
int c[N];
pair<int,int> f;

void clearv()
{
    for(int i=0;i<N;i++)
    {
        z[i] = c[i] = 0;
        v[i].resize(0);
    }
}

void deepsearch(int n, int d)
{
    if(z[n]) return;
    if(d > f.second) f.second = d, f.first = n;
    z[n] = 1;
    for(auto u : v[n])
    {
        deepsearch(u, d+1);
    }
}

void downdist(int n, int p)
{
    c[n] = 0;
    for(auto u : v[n])
    {
        if(u == p) continue;
        downdist(u, n);
        c[n] = c[u]+1 > c[n] ? c[u]+1 : c[n];
    }
}

void updist(int n)
{

}

int main()
{
    cin>>t;
    int n;
    for(int i=0;i<t;i++)
    {
        clearv();

        cin>>n;
        int a,b;
        for(int j=0;j<n-1;j++)
        {
            cin>>a>>b;
            v[a].push_back(b);
            v[b].push_back(a);
        }

        deepsearch(1, 0);
        int s = f.first;
        f = {0,0};

        downdist(s, 0);
        updist(s);
        cout<<s<<endl;
        for(int j=0;j<n;j++)
        {
            cout<<c[i]<<" ";
        }

        // route(s);
    }
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER