题目:
Give a tree with n vertices,each edge has a length(positive integer less than 1001).
Define dist(u,v)=The min distance between node u and v.
Give an integer k,for every pair (u,v) of vertices is called valid if and only if dist(u,v) not exceed k.
Write a program that will count how many pairs which are valid for a given tree.
输入:
The input contains several test cases. The first line of each test case contains two integers n, k. (n<=10000) The following n-1 lines each contains three integers u,v,l, which means there is an edge between node u and v of length l.
The last test case is followed by two zeros.
输出:
For each test case output the answer on a single line.
样例:
Sample Input
5 4
1 2 3
1 3 1
1 4 2
3 5 1
0 0
Sample Output
8
题目大意:
给你一棵树,有n个结点,每一条树边有一个权值。规定dist(u,v)为从u到v的距离。给你一个数k,让你求出有多少对(u,v),他们的距离小于等于k。
解题思路:
典型树分治的题目,先求通过根的距离小于K的路径,容斥一下让这些路径不来自同一颗子树。然后算完来自根之后,就递归解决子树的答案。
#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 10005;
int n, k;
struct Edge{
int to, nxt, weight;
}edges[maxn<<2];
int tot;
int head[maxn<<2];
void addEdge(int u, int v, int w)
{
edges[tot] = Edge{v,head[u],w};
head[u] = tot++;
}
int vis[maxn]; //用来记录该结点是否被删除了。
int ans;
int siz[maxn];
int root; //一个全局变量,用来记录当前子树的重心
int totsize;
int minn; //用来记录子树的最小最大值
void getsize(int u, int fa) //求树的各个节点的子树大小,用来求树的重心
{
siz[u] = 1;
for(int i = head[u]; ~i; i = edges[i].nxt)
{
int v = edges[i].to;
if(v==fa||vis[v])
continue;
getsize(v,u);
siz[u]+=siz[v];
}
}
void getroot(int u, int fa) //求树的重心
{
int maxx = totsize-siz[u];
for(int i = head[u]; ~i; i = edges[i].nxt)
{
int v = edges[i].to;
if(v==fa||vis[v])
continue;
getroot(v,u);
maxx = max(maxx,siz[v]);
}
if(maxx<minn)
{
minn = maxx;
root = u;
}
}
vector<int>v;
void getdis(int u,int fa, int w)
{
v.push_back(w);
for(int i = head[u];~i; i =edges[i].nxt)
{
int v = edges[i].to;
int w1 = edges[i].weight;
if(vis[v]||v==fa)continue;
getdis(v,u,w+w1);
}
}
void cal(int u, int flag, int w)
{
v.clear();
if(flag == -1)
v.push_back(w);
for(int i = head[u];~i; i =edges[i].nxt)
{
int v = edges[i].to;
int w1 = edges[i].weight;
if(vis[v])continue;
getdis(v,u,w+w1);
}
sort(v.begin(),v.end());
// cout << "vector shows "<<endl;
// for(int i = 0; i < v.size(); i++)
// cout <<v[i]<<" ";
// cout <<endl;
int len = v.size();
int l = 0;
for(int i = 0; i < len; i++)
{
if(v[i]<=k&&flag==1)
ans++;
while(l+1<i&&v[i]+v[l+1]<=k) l++;
while(l-1>=0&&v[i]+v[l]>k)l--;
if((l==0&&v[i]+v[l]>k)||(i==0)){}
else{
ans+=(flag)*(l+1);
}
// cout << ans<<" #"<<l<<" ";
}
// cout <<endl;
}
int print1;
void solve(int u)
{
// cout << "the "<< print1<<"th solve() u == "<< u<<endl;
getsize(u,-1); //先获取子树的结点总数
// cout << "size of the tree == " << siz[u]<<endl;
totsize = siz[u];
minn = inf;
getroot(u,-1); //获取重心
// cout << "root of the tree == "<< root<<endl;
u = root;
vis[u] = 1;
cal(u,1,0);
// cout << "after "<<print1<<"th cal ans == "<<ans<<endl;
print1++;
// cout <<endl;
for(int i = head[u]; ~i; i = edges[i].nxt)
{
int v = edges[i].to;
int w = edges[i].weight;
if(vis[v])
continue ;
// cout << "u == "<< u <<" v == "<< v<<" w == "<<w <<endl;
cal(v,-1,w);
// cout << "after cal ans == "<<ans<<endl;
solve(v);
}
}
int main()
{
while(scanf("%d%d", &n, &k)&&n)
{
tot = 1;
ans = 0;
memset(head,-1,sizeof(head));
memset(vis,0,sizeof(vis));
int u ,v ,w;
for(int i = 1; i < n; i++)
{
scanf("%d%d%d", &u, &v, &w);
addEdge(u,v,w);
addEdge(v,u,w);
}
print1 = 1;
solve(1);
printf("%d\n", ans);
}
return 0;
}