POJ1741:tree

传送门

时隔一个月再次写点分治，比上一次要深入理解很多了。（虽然代码还是写不熟

模板题，不多说

//POJ 1741
//by Cydiater
//2016.9.22
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <ctime>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
using namespace std;
#define ll long long
#define up(i,j,n)        for(int i=j;i<=n;i++)
#define down(i,j,n)        for(int i=j;i>=n;i--)
const int MAXN=1e6+5;
const int oo=0x3f3f3f3f;
inline int read(){
    char ch=getchar();int x=0,f=1;
    while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int N,K,LINK[MAXN],len=0,root,siz[MAXN],sum,max_siz[MAXN],ans,dis[MAXN],head,tail,q[MAXN];
bool vis[MAXN];
struct edge{
    int y,next,v;
}e[MAXN];
namespace solution{
    inline void insert(int x,int y,int v){e[++len].next=LINK[x];LINK[x]=len;e[len].y=y;e[len].v=v;}
    void init(){
        if(N==0&&K==0)exit(0);
        len=ans=root=0;
        memset(LINK,0,sizeof(LINK));
        memset(vis,0,sizeof(vis));
        up(i,2,N){
            int x=read(),y=read(),v=read();
            insert(x,y,v);
            insert(y,x,v);
        }
    }
    void make_root(int node,int fa){
        siz[node]=1;max_siz[node]=0;
        for(int i=LINK[node];i;i=e[i].next)if(!vis[e[i].y]&&e[i].y!=fa){
            make_root(e[i].y,node);
            siz[node]+=siz[e[i].y];
            max_siz[node]=max(max_siz[node],siz[e[i].y]);
        }
        max_siz[node]=max(max_siz[node],sum-max_siz[node]);
        if(max_siz[node]<max_siz[root])root=node;
    }
    void get_deep(int node,int fa){
        q[++tail]=dis[node];
        for(int i=LINK[node];i;i=e[i].next)if(!vis[e[i].y]&&e[i].y!=fa){
            dis[e[i].y]=dis[node]+e[i].v;
            get_deep(e[i].y,node);
        }
    }
    int col(int node,int dist){
        int tmp=0;
        dis[node]=dist;head=1;tail=0;
        get_deep(node,0);
        sort(q+1,q+tail+1);
        while(head<tail){
            while(q[head]+q[tail]>K&&head<tail)tail--;
            tmp+=tail-head;
            head++;
        }
        return tmp;
    }
    void work(int node){
        ans+=col(node,0);vis[node]=1;
        for(int i=LINK[node];i;i=e[i].next)
            if(!vis[e[i].y]){
                ans-=col(e[i].y,e[i].v);
                sum=siz[e[i].y];root=0;
                make_root(e[i].y,node);
                work(root);
            }
    }
    void slove(){
        root=N;sum=0;max_siz[0]=oo;
        make_root(1,0);
        work(root);
    }
    void output(){
        printf("%d\n",ans);
    }
}
int main(){
    //freopen("input.in","r",stdin);
    using namespace solution;
    while(scanf("%d %d",&N,&K)!=EOF){
        init();
        slove();
        output();
    }
    return 0;
}