bzoj3052 [wc2013] Candy Park, "the team in the tree" "with the repair team"

#include <cstdio> #include <cstring> #include <algorithm> #include <cmath>using namespace std;# Define N 100001typedef Long long ll;int v[n<<1],en,first[n],next[n<<1];void addedge (int u,int v) {v[++en]=v; next[en]=first[u];first[u]=en;} int n,m,a[n],b[n];int eq,ec,blo,sz,siz[n],top[n],fa[n],dep[n],num[n];void DFS (int U) {for (int i=first[u];i;i=next[i]      ) if (V[i]!=fa[u]) {fa[v[i]]=u;      dep[v[i]]=dep[u]+1;          if (Siz[top[u]]<sz) {++siz[top[u]];        Top[v[i]]=top[u];    } dfs (V[i]); }}void df2 (int U) {num[u]=blo;for (int i=first[u];i;i=next[i]) if (V[i]!=fa[u]&&top[v[i]]==top[u]) DF2 (V[i]);}    int LCA (int u,int V) {while (u!=v) {if (Top[u]!=top[v]) {if (Dep[top[u]]<dep[top[v]]) swap (U,V);    U=fa[top[u]];    } else {if (Dep[u]<dep[v]) swap (U,V);    U=fa[u]; }}return U;} struct Upt{int x, y, Z;} Ch[n];struct ask{int l,r,p,t;} Q[n];bool operator < (const ask &a,const ask &b{if (NUM[A.L]==NUM[B.L]) {if (NUM[A.R]==NUM[B.R]) return a.t<b.t;      Return num[a.r]<num[b.r]; } return NUM[A.L]&LT;NUM[B.L];} ll Anss[n],ans;int Vs[n],ws[n],q;bool vis[n];int t[n];void Update (int x,int op) {if (op==-1) ans-= (LL) vs[x]* (LL) ws[t[x]] ; T[x]+=op;if (op==1) ans+= (LL) vs[x]* (LL) ws[t[x];}        void work (int. u,int V,int LCA) {while (U!=LCA) {vis[u]^=1;        Update (a[u],vis[u]?1:-1);      U=fa[u];        } while (V!=LCA) {vis[v]^=1;        Update (a[v],vis[v]?1:-1);      V=FA[V]; }}int Main () {int x, y, bool op;scanf ("%d%d%d", &n,&m,&q), for (int i=1;i<=m;++i) scanf ("%d", &vs[i]);   for (int i=1;i<=n;++i) scanf ("%d", &ws[i]), and for (int i=1;i<n;++i) {scanf ("%d%d", &x,&y);   Addedge (x, y);  Addedge (Y,X);  }for (int i=1;i<=n;++i) scanf ("%d", &a[i]); for (int i=1;i<=n;++i) {top[i]=i;  Siz[i]=1;  }sz= (int) Pow ((double) n,2.0/3.0);d FS (1); for (int i=1;i<=n;++i) if (top[i]==i) {    ++blo;    DF2 (i);  }en=n;memcpy (b,a,sizeof (int) * (n+1)), for (int i=1;i<=q;++i) {scanf ("%d", &op);    if (!op) {++ec; ++en;    scanf ("%d%d", &ch[ec].x,&ch[ec].y);    Ch[ec].z=b[ch[ec].x];    B[CH[EC].X]=CH[EC].Y;    } else {++eq;    scanf ("%d%d", &AMP;Q[EQ].L,&AMP;Q[EQ].R); Q[eq].t=ec;    Q[eq].p=eq;    }} sort (q+1,q+eq+1); for (int i=1;i<=q[1].t;++i) a[ch[i].x]=ch[i].y;    int Lca=lca (Q[1].L,Q[1].R);    Work (Q[1].L,Q[1].R,LCA);    Update (a[lca],1);    Anss[q[1].p]=ans;    Update (a[lca],-1); for (int i=2;i<=eq;++i) {if (q[i-1].t<q[i].t) for (int j=q[i-1].t+1;j<=q[i].t;++j) {if              (vis[ch[j].x])                {Update (ch[j].y,1);              Update (a[ch[j].x],-1);          } a[ch[j].x]=ch[j].y; } else for (int j=q[i-1].t;j>q[i].t;--j) {if (vis[ch[j].x]) {UPD                Ate (ch[j].z,1);   Update (a[ch[j].x],-1);           } a[ch[j].x]=ch[j].z;        } work (Q[i-1].l,q[i].l,lca (Q[I-1].L,Q[I].L));        Work (Q[i-1].r,q[i].r,lca (Q[I-1].R,Q[I].R));        Lca=lca (Q[I].L,Q[I].R);        Update (a[lca],1);        Anss[q[i].p]=ans;      Update (a[lca],-1); } for (int i=1;i<=eq;++i) printf ("%lld\n", Anss[i]); return 0;}

"Mo Team" "with the team" bzoj3052 [wc2013] Candy Park