1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164
| #include <bits/stdc++.h> #define MAXN 100005 using namespace std; inline int read(){ int x=0,f=1; char ch=getchar(); while (ch<'0'||ch>'9'){ if (ch=='-') f=-1; ch=getchar(); } while (ch<='9'&&ch>='0'){ x=(x<<3)+(x<<1)+(ch^48); ch=getchar(); } return x*f; } inline void swap(int &a,int &b){ int temp=a; a=b; b=temp; } vector<int>G[MAXN]; int value[MAXN],size[MAXN],fa[MAXN],dep[MAXN],top[MAXN],id[MAXN],Bigson[MAXN]; int root[MAXN],cnt; void dfs(int u,int father){ fa[u]=father; size[u]=1; Bigson[u]=0; dep[u]=dep[father]+1; for (register int i=0;i<G[u].size();++i){ if (G[u][i]!=father){ dfs(G[u][i],u); size[u]+=size[G[u][i]]; if (Bigson[u]==0||size[G[u][i]]>size[Bigson[u]]){ Bigson[u]=G[u][i]; } } } } void dfs2(int u,int Top){ top[u]=Top; id[u]=++cnt; if (!Bigson[u]){ return ; } dfs2(Bigson[u],Top); for (register int i=0;i<G[u].size();++i){ if (G[u][i]!=fa[u]&&G[u][i]!=Bigson[u]){ dfs2(G[u][i],G[u][i]); } } } struct SegmentTree{ struct node{ int l,r; int maxn,sum; }tree[MAXN<<5]; #define lc tree[i].l #define rc tree[i].r int tot_node; SegmentTree(){ tot_node=0; } void pushup(int i){ tree[i].maxn=max(tree[lc].maxn,tree[rc].maxn); tree[i].sum=tree[lc].sum+tree[rc].sum; } void update(int &i,int L,int R,int pos,int val){ if (!i) i=++tot_node; if (L==R){ tree[i].maxn=tree[i].sum=val; return ; } int mid=(L+R)>>1; if (pos<=mid) update(lc,L,mid,pos,val); else update(rc,mid+1,R,pos,val); pushup(i); } int query_max(int i,int qL,int qR,int L,int R){ if (qL<=L&&R<=qR){ return tree[i].maxn; } int mid=(L+R)>>1; int ans=-0x7fffffff; if (qL<=mid) ans=max(ans,query_max(lc,qL,qR,L,mid)); if (mid<qR) ans=max(ans,query_max(rc,qL,qR,mid+1,R)); return ans; } int query_sum(int i,int qL,int qR,int L,int R){ if (qL<=L&&R<=qR){ return tree[i].sum; } int mid=(L+R)>>1,ans=0; if (qL<=mid) ans+=query_sum(lc,qL,qR,L,mid); if (mid<qR) ans+=query_sum(rc,qL,qR,mid+1,R); return ans; } #undef lc #undef rc }Seg; int w[MAXN],c[MAXN],n; inline int query_ans(int u,int v,int type){ int color=c[u]; int sum=0,maxval=-0x7fffffff; while (top[u]!=top[v]){ if (dep[top[u]]<dep[top[v]]){ swap(u,v); } if (type==0){ sum+=Seg.query_sum(root[color],id[top[u]],id[u],1,cnt); } else { maxval=max(maxval,Seg.query_max(root[color],id[top[u]],id[u],1,cnt)); } u=fa[top[u]]; } if (id[u]>id[v]){ swap(u,v); } if (type==0){ sum+=Seg.query_sum(root[color],id[u],id[v],1,cnt); return sum; } else { maxval=max(maxval,Seg.query_max(root[color],id[u],id[v],1,cnt)); return maxval; } } int main(){ int q; n=read(),q=read(); for (register int i=1;i<=n;++i){ w[i]=read(),c[i]=read(); } for (register int i=1;i<n;++i){ int u,v; u=read(),v=read(); G[u].push_back(v),G[v].push_back(u); } dfs(1,1),dfs2(1,1); for (register int i=1;i<=n;++i){ Seg.update(root[c[i]],1,n,id[i],w[i]); } char opr[10]; while (q--){ scanf("%s",opr); if (opr[0]=='C'){ if (opr[1]=='C'){ int u,color; u=read(),color=read(); Seg.update(root[c[u]],1,n,id[u],0); Seg.update(root[c[u]=color],1,n,id[u],w[u]); } else{ int u,weight; u=read(),weight=read(); Seg.update(root[c[u]],1,n,id[u],w[u]=weight); } } else if (opr[0]=='Q'){ printf("%d\n",query_ans(read(),read(),opr[1]=='M')); } } }
|