题意:
给出一棵树,每条边都有一个权值 w w w,求一共有多少个点对的路径权值和小于 K K K
题解:
点分治模板题
#include<iostream>
#include<sstream>
#include<string>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<stack>
#include <utility>
#include<algorithm>
#include<cstdio>
#include<list>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<time.h>
//#define int long long
#define PI acos(-1.0)
#define eps 1e-9
#define lowbit(a) ((a)&-(a))
const int mod = 1e9+7;
using namespace std;
inline int read(){
char c=getchar();int x=0,s=1;
while(c<'0'||c>'9'){if(c=='-')s=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*s;
}
void inar(int a[],int n){for(int i=1;i<=n;i++)cin>>a[i];}
void outar(int a[],int n){for(int i=1;i<=n;i++)cout<<a[i]<<" ";cout<<endl;}
int qpow(int a,int b){
int ans=1;
while(b){
if(b&1)ans=(ans*a)%mod;
a=(a*a)%mod;
b>>=1;
}
return ans;
}
#define endl '\n'
const int INF = 0x3f3f3f3f;
const int N = 1e4+100;
const int maxn = 1e3+10;
struct edge{
int w,to,next;
}e[2*N];
int head[N],cnt,n,k,ans;
int dis[N],vis[N],son[N],sz[N];
int alls,MX,rt,m;
void add(int u,int v,int w){
e[++cnt].w=w;
e[cnt].to=v;
e[cnt].next=head[u];
head[u]=cnt;
}
void init(){
memset(head,0,sizeof head);
memset(vis,0,sizeof vis);
cnt=ans=0;
MX=INF,alls=n;
}
void getrt(int u,int fa){//找树的重心
sz[u]=1,son[u]=0;
for(int i=head[u];i;i=e[i].next){
int v=e[i].to;
if(v==fa||vis[v])continue;
getrt(v,u);
sz[u]+=sz[v];
son[u]=max(sz[v],son[u]);
}
son[u]=max(son[u],alls-sz[u]);
if(son[u]<MX)rt=u,MX=son[u];
}
void getdis(int u,int fa,int dist){//计算根节点到其子树各个节点的距离
dis[++m]=dist;
for(int i=head[u];i;i=e[i].next){
int v=e[i].to;
if(v==fa||vis[v])continue;
getdis(v,u,dist+e[i].w);
}
return;
}
int calc(int rt,int w){//计算树内满足条件的点对
m=0;
memset(dis,0,sizeof dis);
getdis(rt,0,w);
sort(dis+1,dis+1+m);
int l=1,r=m,res=0;
while(l<=r){
if(dis[r]+dis[l]<=k)res+=r-l,l++;
else r--;
}
return res;
}
void div(int tr){
ans+=calc(tr,0);
vis[tr]=1;
for(int i=head[tr];i;i=e[i].next){
int v=e[i].to;
if(vis[v])continue;
ans-=calc(v,e[i].w);
alls=son[v],rt=0,MX=INF;
getrt(v,v); //
div(rt);
}
}
signed main(){
std::ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
while(scanf("%d%d",&n,&k)!=EOF){
if(n==0&&k==0)break;
init();
for(int i=1;i<n;i++){
int u,v,w; scanf("%d%d%d",&u,&v,&w);//cin会超时
add(u,v,w); add(v,u,w);
}
getrt(1,0);
div(rt);
cout<<ans<<endl;
}
}