题目链接:http://acm.nyist.edu.cn/JudgeOnline/problem.php?pid=20
#include<iostream>
#include<cstdio>#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<vector>
#include<algorithm>
#define N 100005
using namespace std;
int ans[N],flag[N],n,s;//n代表城市的个数 ,s代表出发城市编号
vector<int> map[N];//数据太大,用不了二维数组
void init()
{
for(int i = 1; i <= n; i++)
map[i].clear();
memset(ans,-1,sizeof(ans));
memset(flag,0,sizeof(flag));
}
void DFS(int s)
{
flag[s] = 1;
//由于vector清空了,所以里面的size为0,不能使用map[s][i]
// for(int i = 1; i <= n; i++)
// {
// if(map[s][i] == 1 && !flag[i])
// {
// ans[i] = s;
// DFS(i);
// }
// }
//尽量用迭代器的方式遍历
for(vector<int>::iterator it=map[s].begin();it != map[s].end();it++){
if(!flag[*it]){
ans[*it] = s;
DFS(*it);
}
}
}
int main()
{
int t,from,to;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&s);
init();
int temp = n-1;
while(temp--)
{
scanf("%d%d",&from,&to);
map[from].push_back(to);
map[to].push_back(from);
//无向图
}
DFS(s);
//for_each(ans,ans+n,print());
for(int i = 1; i <= n; i++)
{
if(i == n)
printf("%d\n",ans[i]);
else
printf("%d ",ans[i]);
}
}
return 0;
}