题目:
CodeForces - 600E: Lomsat gelral
题意:
给定一颗树,每个点有一个颜色,求每颗子树下颜色的众数的颜色和
笔记:
dsu on tree:
一直以为就是并查集,实际上是一种优雅的暴力,主要解决:
(1)能离线且不带修改
(2)需要统计子树下每个节点的信息来得到答案
复杂度 O(NlogN),证明见:dsu on tree入门
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 2e5+25;
int head[maxn],c[maxn],n,u,v,cnt;
struct edge{
int to,nxt;
}e[maxn<<1];
inline void add(int u,int v){
e[++cnt] = (edge){v,head[u]};
head[u] = cnt;
}
int son[maxn],sz[maxn];
void dfs(int x,int fa){ //得到重儿子
sz[x] = 1;
for(int i = head[x];i > 0;i = e[i].nxt){
int v = e[i].to; if(v == fa) continue;
dfs(v,x); sz[x] += sz[v];
if(sz[v] > sz[son[x]]) son[x] = v;
}
}
LL ans[maxn],sum,p,num[maxn];
void deal(int x,int fa,int Son,int val){ //暴力轻儿子的子树
num[c[x]] += val;
if(num[c[x]] > p) sum = c[x],p = num[c[x]];
else if(num[c[x]] == p) sum += c[x];
for(int i = head[x];i > 0;i = e[i].nxt){
int v = e[i].to; if(v == fa||v == Son) continue;
deal(v,x,Son,val);
}
}
void dsu(int x,int fa,int op){ //dsu on tree
for(int i = head[x];i > 0;i = e[i].nxt){
int v = e[i].to; if(v == fa||v==son[x]) continue;
dsu(v,x,0);
}
if(son[x]) dsu(son[x],x,1);
deal(x,fa,son[x],1); ans[x] = sum;
if(!op) deal(x,fa,0,-1),sum = 0,p = 0;
}
int main(){
scanf("%d",&n);
for(int i = 1;i <= n; ++i) scanf("%d",c+i);
for(int i = 1;i < n; ++i){
scanf("%d %d",&u,&v);
add(u,v), add(v,u);
}
dfs(1,0); dsu(1,0,1);
for(int i = 1;i <= n; ++i) cout << ans[i] << " ";
return 0;
}