题目二 吝啬的国度

#include <iostream>
#include <stdio.h>
#include <vector>
#define MAX 100001
using namespace std;
vector<int>a[MAX];//定义个可变容器
int b[MAX],n,s;//b用来记录父节点
void dfs(int x,int y){
for (int i = 0; i <a[x].size();i++)
if (a[x][i] != y)
dfs(a[x][i],b[a[x][i]]=x);
return;
}
int main(){
int M,x,y;
scanf("%d",&M);
while (M--){
scanf("%d%d",&n,&s);

int i=1;
for (; i <n; i++){
a[i].clear();
}

i=1;//重置i的值
for (; i <n; i++){
scanf("%d%d",&x,&y);
a[x].push_back(y); //相当二维数组
a[y].push_back(x);
}
b[s] = -1;//与S相等则为-1
dfs(s,-1);
for (int i = 1; i <= n; i++)
printf("%d ",b[i]);
printf("\n");
}
return 0;
}