Distances

input/code.cpp: In function 'void solve()':
input/code.cpp:37:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
input/code.cpp:39:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int s, e; scanf("%d %d",&s,&e);
             ~~~~~^~~~~~~~~~~~~~~

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 105;


int n, s, t, par[MAXN], chk[MAXN];
vector<int> gph[MAXN], ans;

void init(){
	memset(par, 0, sizeof(par));
	memset(chk, 0, sizeof(chk));
	ans.clear();
	for(int i=0; i<MAXN; i++) gph[i].clear();
	n = s = t = 0;
}

void dfs(int x, int p){
	par[x] = p;
	for(auto &i : gph[x]){
		if(i != p){
			dfs(i, x);
		}
	}
}

void dfs2(int x, int p, int d){
	if(!d) ans.push_back(x);
	for(auto &i : gph[x]){
		if(i != p && !chk[i]){
			dfs2(i, x, 1 - d);
		}
	}
	if(d) ans.push_back(x);
}

void solve(){ init();
	scanf("%d",&n);
	for(int i=1; i<n; i++){
		int s, e; scanf("%d %d",&s,&e);
		gph[s].push_back(e);
		gph[e].push_back(s);
	}
	s = 1, t = n;
	dfs(s, -1);
	for(int j=t; j!=-1; j=par[j]){
		chk[j] = 1;
	}
	for(int j=t; j!=-1; j=par[j]){
		dfs2(j, -1, j != t);
	}
	reverse(ans.begin(), ans.end());
	for(auto &i : ans) printf("%d ", i);
	puts("");
}

int main(){
	int t; cin >> t;
	while(t--) solve();
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED