LA 3902 Network

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1903

首先把无根树转换成以s为根的树,然后dfs,对叶子结点按照深度分类,顺便求出每个结点的父节点

然后对于每一个深度为d叶子节点,求出它的第d祖先,然后对这个祖先再次进行dfs把这个祖先能够到达的距离小于等于k结点标为已被覆盖.

#include <iostream>
#include <vector>
#include <cstdio>
#include <memory.h>
using namespace std;
const int maxn = 1001;

int n, s, k, ans;
vector<int>g[maxn], nodes[maxn];
int fa[maxn];
bool vis[maxn];
void dfs1(int u, int f, int d){
	fa[u] = f;//纪录父亲结点
	if(g[u].size() == 1 && d > k){//必须是叶子结点,并且距离s大于k(未被s覆盖)
		nodes[d].push_back(u);
	}
	for(int i = 0; i < g[u].size(); ++i){
		int v = g[u][i];
		if(v != f){
			dfs1(v, u, d + 1);
		}
	}
}

void dfs2(int u, int f, int d){
	vis[u] = 1;
	for(int i = 0; i < g[u].size(); ++i){
		int v = g[u][i];
		if(v != f && d + 1 <= k){//能够覆盖的距离小于等于k的结点
			dfs2(v, u, d + 1);
		}
	}
}
int main(){
	int T;
	scanf("%d", &T);
	while(T--){
		scanf("%d", &n);
		scanf("%d%d", &s, &k);
		memset(vis, 0, sizeof(vis));
		for(int i = 1; i <= n; ++i){
			g[i].clear();
			nodes[i].clear();
		}
		for(int i = 0; i < n - 1; ++i){
			int u, v;
			scanf("%d %d", &u, &v);
			g[u].push_back(v);
			g[v].push_back(u);
		}
		ans = 0;
		dfs1(s, -1, 0);
		for(int d = n - 1; d > k ; --d){//按深度从大到小来枚举
			for(int i = 0; i < nodes[d].size(); ++i){
				int u = nodes[d][i];
				if(vis[u])continue;//保证结点未被覆盖
				int v = u;
				for(int j = 0; j < k; ++j)v = fa[v];//找出第k祖先
				dfs2(v, 0, 0);
				ans++;
			}
		}
		printf("%d\n", ans);
	}
}