bzoj3052 [wc2013]糖果公园 树上带修改莫队

Description

---

给定一棵树，每个点有颜色。要求资磁
1. 修改x颜色为y
2. 查询x到y路径上所有点颜色的权值*出现次数的权值

Solution

---

树上带修改莫队，ppt里面的例题，非常裸但是非常慢
一开始挂了是因为没排序(lll￢ω￢)
只需要注意带修改莫队的块大小应设为$n^{\frac{2}{3}}$

Code

---

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#define rep(i,st,ed) for (register int i=st;i<=ed;++i)
#define drp(i,st,ed) for (register int i=st;i>=ed;--i)

typedef long long LL;
const int N=200005;
const int E=200005;

struct Q {int l,r,lca,x,id;} q[N];
struct P {int x,c;} p[N];
struct edge {int y,next;} e[E];

LL ans[N],w[N],v[N],cur;
int ind[N],out[N],fa[N],bl[N],size[N],dep[N];
int a[N],rec[N],ls[N],edCnt=1;
int bel[N],c[N],qCnt,pCnt,B;
bool vis[N];

inline int read() {
    int x=0,v=1; char ch=getchar();
    for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):(v),ch=getchar());
    for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
    return x*v;
}

inline void swap(int &x,int &y) {
    int z=x; x=y; y=z;
}

inline int max(int x,int y) {
    return x>y?x:y;
}

inline int min(int x,int y) {
    return x<y?x:y;
}

void add_edge(int x,int y) {
    e[++edCnt]=(edge) {y,ls[x]}; ls[x]=edCnt;
    e[++edCnt]=(edge) {x,ls[y]}; ls[y]=edCnt;
}

bool cmp(Q a,Q b) {
    int al=a.l/B,bl=b.l/B;
    if (al==bl&&a.r==b.r) return a.x<b.x;
    if (al==bl) return a.r<b.r;
    return al<bl;
}

void dfs1(int now) {
    a[++a[0]]=now; ind[now]=a[0]; size[now]=1;
    for (int i=ls[now];i;i=e[i].next) {
        if (e[i].y==fa[now]) continue;
        fa[e[i].y]=now; dep[e[i].y]=dep[now]+1;
        dfs1(e[i].y); size[now]+=size[e[i].y];
    }
    a[++a[0]]=now; out[now]=a[0];
}

void dfs2(int now,int up) {
    bl[now]=up; int mx=0;
    for (int i=ls[now];i;i=e[i].next) {
        if (e[i].y!=fa[now]&&size[e[i].y]>size[mx]) mx=e[i].y;
    }
    if (!mx) return ;
    dfs2(mx,up);
    for (int i=ls[now];i;i=e[i].next) {
        if (e[i].y!=fa[now]&&e[i].y!=mx) dfs2(e[i].y,e[i].y);
    }
}

inline int get_lca(int x,int y) {
    while (bl[x]!=bl[y]) {
        if (dep[bl[x]]<dep[bl[y]]) swap(x,y);
        x=fa[bl[x]];
    }
    if (dep[x]<dep[y]) return x;
    return y;
}

inline void modify(int x) {
    vis[x]^=1; int cc=c[x];
    if (vis[x]) cur+=w[++rec[cc]]*v[cc];
    else cur-=w[rec[cc]--]*v[cc];
}

inline void change(int x) {
    int xx=p[x].x;
    if (!vis[xx]) {
        swap(c[xx],p[x].c);
    } else {
        cur-=w[rec[c[xx]]--]*v[c[xx]];
        swap(c[xx],p[x].c);
        cur+=w[++rec[c[xx]]]*v[c[xx]];
    }
}

int main(void) {
    freopen("data.in","r",stdin);
    freopen("myp.out","w",stdout);
    int n=read(),m=read(),T=read(); B=pow(n*2,0.6666)/2;
    rep(i,1,m) v[i]=read();
    rep(i,1,n) w[i]=read();
    rep(i,2,n) add_edge(read(),read());
    rep(i,1,n) c[i]=read();
    dep[1]=1; dfs1(1); dfs2(1,1);
    rep(i,1,T) {
        int opt=read(),x=read(),y=read();
        if (!opt) p[++pCnt]=(P) {x,y};
        else {
            int lca=get_lca(x,y);
            if (lca==x||lca==y) {
                q[++qCnt]=(Q) {min(ind[x],ind[y]),max(ind[x],ind[y]),lca,pCnt,qCnt};
            } else {
                if (out[x]<ind[y]) q[++qCnt]=(Q) {out[x],ind[y],lca,pCnt,qCnt};
                else q[++qCnt]=(Q) {out[y],ind[x],lca,pCnt,qCnt};
            }
        }
    }
    std:: sort(q+1,q+qCnt+1,cmp);
    int l=1,r=0,x=0;
    rep(i,1,qCnt) {
        for (;r<q[i].r;) modify(a[++r]);
        for (;r>q[i].r;) modify(a[r--]);
        for (;l<q[i].l;) modify(a[l++]);
        for (;l>q[i].l;) modify(a[--l]);
        for (;x<q[i].x;) change(++x);
        for (;x>q[i].x;) change(x--);
        if (!vis[q[i].lca]) {
            ans[q[i].id]=cur+w[1+rec[c[q[i].lca]]]*v[c[q[i].lca]];
        } else ans[q[i].id]=cur;
    }
    rep(i,1,qCnt) printf("%lld\n", ans[i]);
    return 0;
}