题意:给一棵n个点有边权的树,m次询问,第i次询问有多少点对的简单路径上最大边权不超过。
题解:直接在一棵建好的树上搞貌似不太可行...好像点分治可以莽一下?于是尝试离线做法,把询问从小到大排序,每次把边权小于当前询问的边都连起来,算一下合并联通块造成的贡献即可。
我居然不是那个写点分的莽子(偷笑)....
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=2e5+4;
int n,m,fa[N],siz[N];
int etot;
struct Edge {
int u,v,w;
friend bool operator <(const Edge &a,const Edge &b) {
return a.w<b.w;
}
}e[N];
struct Query {
int w,id;
friend bool operator <(const Query &a,const Query &b) {
return a.w<b.w;
}
}q[N];
ll ans[N],temp;
inline int read() {
int x=0,f=1;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x*f;
}
inline int find(int x) {
return fa[x]==x?x:fa[x]=find(fa[x]);
}
inline void merge(int u,int v) {
int fu=find(u),fv=find(v);
if (fu^fv) {
fa[fu]=fv;
temp+=1ll*siz[fv]*siz[fu];
siz[fv]+=siz[fu];
}
}
int main() {
n=read(),m=read();
for (register int i=1;i<=n;++i) {
fa[i]=i;
siz[i]=1;
}
for (register int i=1;i<n;++i) {
int u=read(),v=read(),w=read();
++etot;
e[etot].u=u;
e[etot].v=v;
e[etot].w=w;
}
for (register int i=1;i<=m;++i) {
q[i].w=read();
q[i].id=i;
}
sort(q+1,q+m+1);
sort(e+1,e+etot+1);
int cur=0;
for (register int i=1;i<=m;++i) {
while (e[cur+1].w<=q[i].w&&cur<etot) {
++cur;
merge(e[cur].u,e[cur].v);
}
ans[q[i].id]=temp;
}
for (register int i=1;i<=m;++i)
printf("%lld ",ans[i]);
return 0;
}