LA3902 Network

最新推荐文章于 2017-02-17 19:02:29 发布

KIJamesQi

最新推荐文章于 2017-02-17 19:02:29 发布

阅读量329

点赞数

分类专栏：搜索文章标签： uva 搜索

本文链接：https://blog.csdn.net/KIJamesQi/article/details/48918881

版权

搜索专栏收录该内容

15 篇文章 0 订阅

订阅专栏

该博客介绍了将无向树转换为有向树的DFS方法，并探讨了K距离染色的标记过程，主要涉及图论与搜索算法。

摘要由CSDN通过智能技术生成

思路：无向树转成有向树，dfs；然后就是k距离染色标记；

/*****************************************
Author      :Crazy_AC(JamesQi)
Time        :2015
File Name   :
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>
using namespace std;
#define MEM(a,b) memset(a,b,sizeof a)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> ii;
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
inline int Readint(){
	char c = getchar();
	while(!isdigit(c)) c = getchar();
	int x = 0;
	while(isdigit(c)){
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x;
}
const int maxn = 1000 + 10;
vector<int> g[maxn],node[maxn];
int n,s,k,fa[maxn];
bool vis[maxn];
void dfs(int u,int f,int d){
	fa[u] = f;
	int size = g[u].size();
	if (size == 1 && d > k) node[d].push_back(u);//叶子节点
	for (int i = 0;i < size;i++){
		int v = g[u][i];
		if (v == f) continue;
		dfs(v,u,d + 1);
	}
}
void search(int u,int f,int d){
	vis[u] = true;
	int size = g[u].size();
	for (int i = 0;i < size;i++){
		int v = g[u][i];
		if (v != f && d + 1 <= k) search(v,u,d + 1);
	}
}
int solve(){
	int ans = 0;
	memset(vis, false,sizeof vis);
	for (int d = n - 1;d > k;d--){
		for (int i = 0;i < node[d].size();i++){
			int u = node[d][i];
			if (vis[u]) continue;
			int v = u;
			for (int i = 0;i < k;i++) v = fa[v];
			search(v,-1,0);
			ans++;
		}
	}
	return ans;
}
int main()
{	
	// freopen("in.txt","r",stdin);
	// freopen("out.txt","w",stdout);
	int t;
	scanf("%d",&t);
	while(t--){
		scanf("%d%d%d",&n,&s,&k);
		for (int i = 1;i <= n;i++)
			node[i].clear(),g[i].clear();
		for (int i = 0;i < n - 1;i++){
			int a,b;
			scanf("%d%d",&a,&b);
			g[a].push_back(b);
			g[b].push_back(a);
		}
		dfs(s,-1,0);
		printf("%d\n",solve());
	}
	return 0;
}