[bzoj 3052][wc2013]糖果公园

传送门:http://www.lydsy.com/JudgeOnline/problem.php?id=3052

[wc2013]糖果公园

Time Limit: 200 Sec  Memory Limit: 512 MB
Submit: 1213  Solved: 609
[Submit][Status][Discuss]

Description

 

Input

Output

Sample Input

Sample Input

 

Sample Output

84
131
27
84

树上莫队，把树分块，然后暴力，说起来是挺简单的，然而……

#include<cstdio>
#include<algorithm>
#include<cmath>
//using namespace std;
const int maxn = 100005;
typedef long long ll;
ll ans,res[100005];
int n,m,q;
ll V[maxn],W[maxn],C[maxn];
int h[maxn],nx[maxn<<1],to[maxn<<1],cnt;
int fa[maxn],dep[maxn],sz[maxn],ch[maxn],top[maxn],num[maxn];
int dfn[maxn],stack[maxn],stack_top,dfs_clock;
int pos[maxn],pos_count,block_size,block_count,pre[maxn];
bool vis[maxn];
struct TAG1{
    int x,y,t,id;
}b[maxn];
struct TAG2{
    int x,y,t,pre;
}c[maxn];
int read(){
    int rt=0,fl=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')fl=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){rt=rt*10+ch-'0';ch=getchar();}
    return rt*fl;
}
bool operator < (TAG1 a,TAG1 b){
    if(pos[a.x]==pos[b.x]&&pos[a.y]==pos[b.y])return a.t<b.t;
    else if(pos[a.x]==pos[b.x])return pos[a.y]<pos[b.y];
    else return pos[a.x]<pos[b.x];
}
void add_edge(int u,int v){
    to[++cnt]=v;nx[cnt]=h[u];h[u]=cnt;
    to[++cnt]=u;nx[cnt]=h[v];h[v]=cnt;
}
void dfs1(int x,int pr){
    fa[x]=pr;dep[x]=dep[pr]+1;sz[x]=1;
    for(int i=h[x];i;i=nx[i]){
        if(to[i]==pr)continue;
        dfs1(to[i],x);
        sz[x]+=sz[to[i]];
        if(sz[ch[x]]<sz[to[i]])ch[x]=to[i];
    }
}
void dfs2(int x,int tp){
    top[x]=tp;
    if(ch[x])dfs2(ch[x],tp);
    for(int i=h[x];i;i=nx[i]){
        if(to[i]==ch[x]||to[i]==fa[x])continue;
        dfs2(to[i],to[i]);
    }
}
void dfs3(int x,int pr){
    dfn[x]=++dfs_clock;
    int now=stack_top;
    for(int i=h[x];i;i=nx[i]){
        if(to[i]==pr)continue;
        dfs3(to[i],x);
        if(stack_top-now>=block_size){
            block_count++;
            while(now!=stack_top){
                pos[stack[stack_top--]]=block_count;
            }   
        }
    }
    stack[++stack_top]=x;
}
int lca(int u,int v){
    while(top[u]!=top[v])dep[top[u]]>dep[top[v]]?u=fa[top[u]]:v=fa[top[v]];
    return dep[u]<dep[v]?u:v;
}
void reverse(int x){
    if(vis[x])ans-=W[num[C[x]]]*V[C[x]],num[C[x]]--;
    else num[C[x]]++,ans+=W[num[C[x]]]*V[C[x]];
    vis[x]^=1;
}
void change(int x,int y){
    if(vis[x]){reverse(x);C[x]=y;reverse(x);}
    else C[x]=y;
}
void solve(int x,int y){
    while(x!=y) {
        if(dep[x]>dep[y])reverse(x),x=fa[x];
        else reverse(y),y=fa[y];
    }
}
int main(){
    n=read();m=read();q=read();
    block_size = pow(n,2.0/3)*0.5;
    for(int i=1;i<=m;i++)V[i]=read();
    for(int i=1;i<=n;i++)W[i]=read();
    for(int i=1;i<n;i++)add_edge(read(),read());
    for(int i=1;i<=n;i++)pre[i]=C[i]=read();
    dfs1(1,0);dfs2(1,1);dfs3(1,0);
    block_count++;
    while(stack_top)pos[stack[stack_top--]]=block_count;
//  for(int i=1;i<=n;i++)printf("%d ",pos[i]);
//  puts("\nfsdfsdds\n");
    int c1=0,c2=0;
    for(int i=1;i<=q;i++)
    {
        int typ=read(),x=read(),y=read();
        if(!typ)
        {
            c1++;
            c[c1].x=x;c[c1].y=y;c[c1].pre=pre[x];pre[x]=y;
        }
        else
        {
            c2++;
            if(dfn[x]>dfn[y])std::swap(x,y);
            b[c2].x=x;b[c2].y=y;b[c2].id=c2;b[c2].t=c1;
        }
    }
    std::sort(b+1,b+c2+1);
    for(int i=1;i<=b[1].t;i++)
        change(c[i].x,c[i].y);
    solve(b[1].x,b[1].y);
    int t=lca(b[1].x,b[1].y);
    reverse(t);res[b[1].id]=ans;reverse(t);
    for(int i=2;i<=c2;i++)
    {
        for(int j=b[i-1].t+1;j<=b[i].t;j++)
            change(c[j].x,c[j].y);
        for(int j=b[i-1].t;j>b[i].t;j--)
            change(c[j].x,c[j].pre);
        solve(b[i-1].x,b[i].x);
        solve(b[i-1].y,b[i].y);
        int t=lca(b[i].x,b[i].y);
        reverse(t);res[b[i].id]=ans;reverse(t);
    }
    for(int i=1;i<=c2;i++)
        printf("%lld\n",res[i]);
    return 0;
}