Distances

input/code.cpp: In function 'int main()':
input/code.cpp:78:9: warning: label 'newT' defined but not used [-Wunused-label]
         newT:;
         ^~~~

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define INF 1e9+7
#define all(x) x.begin(),x.end()
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using pii=pair<int,int>;
using ppi=pair<int,pii>;
using oset=tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;
 
template<typename T>
void _print(vector<T> x) {cerr<<"{"; for(auto e:x) cerr<<e<<","; cerr<<"}";}
void _print(pii x) {cerr<<"{"<<x.first<<","<<x.second<<"}";}
template<typename T>
void _print(T x) {cerr<<x;}
 
void dbg() {cerr<<endl;}
template<typename Head,typename... Tail>
void dbg(Head H,Tail... T) {
    _print(H);
    if(sizeof...(T)) cerr<<",";
    else cerr<<"\"]";
    dbg(T...);
}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:[\"",dbg(__VA_ARGS__)
 
int dist[101][101];
vector<bool> flag;
int n;
bool ok;
 
void dfs(int u,int cnt,vector<bool> &flag,vector<int> &path) {
    if(ok) return;
    if(cnt==n) {
        for(auto e:path) {
            cout<<e<<" ";
        }
        cout<<endl;
        ok=true; return;
    }
    for(int i=1;i<=n;i++) {
        if(flag[i]) continue;
        if(dist[u][i]>3) continue;
        flag[i]=true; path.push_back(i);
        dfs(i,cnt+1,flag,path);
        flag[i]=false; path.pop_back();
    }
}
 
int main () {
    ios::sync_with_stdio(false); cin.tie(0);
    int t; cin>>t;
    while(t--) {
        cin>>n;
        for(int i=1;i<=n;i++) {
            for(int j=1;j<=n;j++) {
                if(i==j) dist[i][j]=0;
                else dist[i][j]=INF;
            }
        }
        for(int i=1;i<n;i++) {
            int u,v; cin>>u>>v;
            dist[u][v]=dist[v][u]=1;
        }
        for(int i=1;i<=n;i++) {
            for(int j=1;j<=n;j++) {
                for(int k=1;k<=n;k++) {
                    dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
                }
            }
        }
        flag.resize(n+1); fill(all(flag),false);
        vector<int> path; path.push_back(1); flag[1]=true;
        ok=false; dfs(1,1,flag,path);
        newT:;
    }
}
 

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED