Codeforces Round #582 (Div. 3)G. Path Queries离线+带权并查集

Codeforces Round #582 (Div. 3)G. Path Queries

碰巧的又补了一题离线的题，加深一下对离线的印象，顺便复习一下带权并查集，刚好是一个模板带权并查集- -

题意

给出m组询问，求点对间最大权值边小于k的有多少对

做法

对边权排个序，然后对询问也排个序

在边权小于k的情况下
每次加入一条边后判断连通性，如果本来不联通，加入之后联通，则答案加上方案数1*方案数2，不断的记录下答案即可。

离线的好处是不用重复计算联通区域的答案数

注意

一开始全用了int，显然这题要开ll的

/**
 *  Author1: low-equipped w_udixixi
 *  Author2: Sherؼlock
 *  Date :2019-09-01
 **/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define pb push_back
#define rep(x,a,b) for (ll x=a;x<=b;x++)
#define repp(x,a,b) for (ll x=a;x<b;x++)
#define W(x) printf("%d\n",x)
#define WW(x) printf("%lld\n",x)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<1|1,mid+1,r
using namespace std;
const ll maxn=2e6+7;
const ll INF=1e9;
const ll INFF=1e18;
ll fa[maxn];
ll num[maxn];
ll S[maxn];
ll ans,n,m;
struct node{
    ll u,v,w;
}p[maxn];
struct nodee{
    ll x,id;
}q[maxn];
bool cmp(node a,node b){return a.w<b.w;}
bool cmp2(nodee a,nodee b){return a.x<b.x;}
void init(ll n)
{
    rep(i,1,n)
    {
        fa[i]=i;
        num[i]=1;
    }
}
ll find(ll x)
{
    if (fa[x]!=x)return fa[x]=find(fa[x]);
    else return fa[x];
}
void unite(ll x,ll y)
{
    x=find(x);
    y=find(y);
    ans+=num[x]*num[y];
    fa[x]=y;
    num[y]+=num[x];
}
int main()
{
    ll n,m;
    scanf("%lld%lld",&n,&m);
    init(n);
    rep(i,1,n-1){scanf("%lld%lld%lld",&p[i].u,&p[i].v,&p[i].w);}
    sort(p+1,p+n,cmp);

    rep(i,1,m)
    {
        scanf("%lld",&q[i].x);
        q[i].id=i;
    }
    sort(q+1,q+1+m,cmp2);
    ans=0;
    ll k=1;
    rep(i,1,m)
    {
        while(k<n&&p[k].w<=q[i].x)
        {
            ll x=find(p[k].u);
            ll y=find(p[k].v);
            if (x!=y)
                unite(x,y);
            k++;
        }
        S[q[i].id]=ans;
    }
    rep(i,1,m)
    {
        printf("%lld ",S[i]);
        if (i==n)printf("\n");
    }
    return 0;
}