【题解】poj1741 点分治

题目链接

Description

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.

Input

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.

Output

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

---

第一次接触到的点分治的题，去学习了大佬的题解主要思路摘抄如下：
每次分治，我们首先算出重心，为了计算重心，需要进行两次dfs，第一次把以每个结点为根的子树大小求出来，第二次是从这些结点中找重心

找到重心后，需要统计所有结点到重心的距离，看其中有多少对小于等于K，这里采用的方法就是把所有的距离存在一个数组里，进行快速排序，这是nlogn的，然后用一个经典的相向搜索O(n)时间内解决。但是这些求出来满足小于等于K的里面只有那些路径经过重心的点对才是有效的，也就是说在同一颗子树上的肯定不算数的，所以对每颗子树，把子树内部的满足条件的点对减去。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,k,mi,root,num;
const int N=1e4+10;
struct Edge{
    int v,nx,w;
}edge[N<<1];
int head[N],tot,size[N],mx[N],vis[N],ans,dis[N];
void addedge(int u,int v,int w)
{
    edge[tot].v=v;
    edge[tot].w=w;
    edge[tot].nx=head[u];
    head[u]=tot++;
}
void dfssize(int u,int fa)
{
    size[u]=1;
    mx[u]=0;
    for(int i=head[u];~i;i=edge[i].nx)
    {
        int v=edge[i].v;
        if(v!=fa&&!vis[v])
        {
            dfssize(v,u);
            size[u]+=size[v];
            mx[u]=max(mx[u],size[v]);
        }
    }
}
void dfsroot(int r,int u,int fa)
{
    mx[u]=max(mx[u],size[r]-size[u]);
    if(mx[u]<mi)mi=mx[u],root=u;
    for(int i=head[u];~i;i=edge[i].nx)
    {
        int v=edge[i].v;
        if(v!=fa&&!vis[v])dfsroot(r,v,u);
    }
}
void dfsdis(int u,int d,int fa)
{
    dis[num++]=d;
    for(int i=head[u];~i;i=edge[i].nx)
    {
        int v=edge[i].v;
        if(v!=fa&&!vis[v])dfsdis(v,d+edge[i].w,u);
    }
}
int calc(int u,int d)
{
    int ret=0;
    num=0;
    dfsdis(u,d,0);
    sort(dis,dis+num);
    int i=0,j=num-1;
    while(i<j)
    {
        while(dis[i]+dis[j]>k&&i<j)j--;
        ret+=j-i;
        i++;
    }
    return ret;
}
void dfs(int u)
{
    mi=n;
    dfssize(u,0);
    dfsroot(u,u,0);
    ans+=calc(root,0);
    vis[root]=1;
    for(int i=head[root];~i;i=edge[i].nx)
    {
        int v=edge[i].v;
        if(!vis[v])
        {
            ans-=calc(v,edge[i].w);
            dfs(v);
        }
    }
}
int main()
{
    //freopen("in.txt","r",stdin);
    while(scanf("%d%d",&n,&k)&&n&&k)
    {
        memset(head,-1,sizeof(head));
        memset(vis,0,sizeof(vis));
        ans=tot=0;
        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);
        dfs(1);
        printf("%d\n",ans);
    }
    return 0;
}