【BZOJ】3924幻想乡战略游戏-点分树

传送门:bzoj3924

---

题解

暴力点分树往上跳。

---

代码

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cstdlib>
#include<cctype>
#include<vector>
#define inf 0x7fffffff
using namespace std;
typedef long long ll;
const int N=1e5+10;
int f[N],rt,root,n,Q,S,MX,dfn,in[N];
int bin[N<<1];
int head[N],to[N<<1],nxt[N<<1],tot;
int sz[N];
int cnt;
ll lca[N<<1][20],d[N],s1[N],s2[N],s3[N],w[N<<1],now;
bool vis[N];
vector <int> A[N],B[N];
char cc;
inline int rd()
{
    int x=0,f=1;
    while(!isdigit(cc=getchar())) if(cc=='-') f=-1;
    x=(cc^48);
    while(isdigit(cc=getchar())){x+=(x<<2);x+=(x+(cc^48));}
    return x*f;
}
inline int imax(int x,int y){return x>y?x:y;}
inline int imin(int x,int y){return x>y?y:x;}
inline ll lmin(ll x,ll y){return x<y?x:y;}
inline void lk(int u,int v,ll val)
{to[++tot]=v;nxt[tot]=head[u];head[u]=tot;w[tot]=val;}

inline void dfs(int x,int fa)
{
    lca[++dfn][0]=d[x];in[x]=dfn;
    for(int i=head[x];i;i=nxt[i]) if(to[i]!=fa){
        d[to[i]]=d[x]+w[i];
        dfs(to[i],x);lca[++dfn][0]=d[x];
    }
}

inline int getroot(int x,int fa)
{
    sz[x]=1;int res=0;
    for(int i=head[x];i;i=nxt[i]){
        int e=to[i];
        if(vis[e] || e==fa) continue;
        getroot(e,x);
        sz[x]+=sz[e];
        if(res<sz[e]) res=sz[e];
    }
    res=imax(res,S-sz[x]);
    if(res<MX) {MX=res;root=x;}
}

inline void solve(int x)
{
    vis[x]=true;
    for(int i=head[x];i;i=nxt[i]){
        int e=to[i];
        if(vis[e]) continue;
        S=sz[e];MX=inf;
        getroot(e,x);
        f[root]=x;
        A[x].push_back(root);
        B[x].push_back(e);
        solve(root);
    }
}

inline ll LCA(int x,int y)
{
    x=in[x],y=in[y];
    if(x>y) swap(x,y);
    int t=bin[y-x+1];
    return lmin(lca[x][t],lca[y-(1<<t)+1][t]); 
}

inline ll dis(int x,int y)
{return d[x]+d[y]-2*LCA(x,y);}

inline void modify(int ori,int x,ll val)
{
    s1[x]+=dis(ori,x)*val;s3[x]+=val;
    if(!f[x]) return;
    s2[x]+=dis(f[x],ori)*val;
    modify(ori,f[x],val);
}

inline ll get_dis(int ori,int x)
{
    ll ret=s1[x];
    if(f[x]) ret+=get_dis(ori,f[x])-s2[x]+(s3[f[x]]-s3[x])*dis(f[x],ori);
    return ret;
}

inline void optimalstra(int x)
{
    for(int i=0;i<A[x].size();i++){
        if(get_dis(B[x][i],B[x][i])<now){now=get_dis(A[x][i],A[x][i]);optimalstra(A[x][i]);return;}
    }
}

int main(){
    int i,j,U,V,W;
    n=rd();Q=rd();
    for(i=1;i<n;i++){U=rd();V=rd();W=rd();lk(U,V,(ll)W);lk(V,U,(ll)W);}
    d[1]=1;dfs(1,0);
    for(i=1;i<=(n<<1);i++) bin[i]=bin[i-1]+((1<<bin[i-1]+1)==i);
    for(i=1;(1<<i)<(n<<1);i++){
        for(j=1;(j+(1<<i))<=(n<<1);j++){
            lca[j][i]= lmin(lca[j][i-1],lca[j+(1<<(i-1))][i-1]);
        }
    }
    S=n;MX=inf;getroot(1,0);rt=root;
    solve(rt);
    while(Q--){
        U=rd();W=rd();
        modify(U,U,(ll)W);now=get_dis(rt,rt);
        optimalstra(rt);
        printf("%lld\n",now);
    }
}