LA 3902 Network -

题目地址：http://vjudge.net/problem/UVALive-3902

#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b)  for(int i=a;i<=(b);++i)
#define REPD(i,a,b) for(int i=a;i>=(b);--i)
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
const int maxn=1000+5;
int fa[maxn],n,s,k;
bool done[maxn];
vector<vector<int> > G(maxn),Deep(maxn);
void DFS(int u,int f,int dep){
	fa[u]=f;
	int size=G[u].size();
	if(size==1&&dep>k) Deep[dep].push_back(u);
	REP(i,0,size-1){
		int v=G[u][i];
		if(v!=f) DFS(v,u,dep+1);
	}
}
void DFS2(int u,int f,int dep){
	done[u]=true;
	int size=G[u].size();
	REP(i,0,size-1){
		int v=G[u][i];
		if(v!=f&&dep<k) DFS2(v,u,dep+1);
	}
}
int solve(){
	int ans=0;
	memset(done,false,sizeof(done));
	REPD(i,n-1,k+1) {
		int size=Deep[i].size();
		REP(j,0,size-1){
			int u=Deep[i][j];
			if(done[u]) continue;
			int v=u;
			REP(d,1,k) v=fa[v];
			DFS2(v,-1,0);
			ans++;
		}
	}
	return ans;
}
int main(int argc, char const *argv[])
{
	int T;	scanf("%d",&T);
	while(T--){
		scanf("%d%d%d",&n,&s,&k);
		REP(i,0,n) G[i].clear(),Deep[i].clear();
		REP(i,1,n-1){
			int u,v;
			scanf("%d%d",&u,&v);
			G[u].push_back(v);
			G[v].push_back(u);
		}
		DFS(s,-1,0);
		printf("%d\n",solve());
	}
	return 0;
}