Codeforce E - Lomsat gelral （dsu on the tree）

E. Lomsat gelral

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a rooted tree with root in vertex 1. Each vertex is coloured in some colour.

Let's call colour c dominating in the subtree of vertex v if there are no other colours that appear in the subtree of vertex v more times than colour c. So it's possible that two or more colours will be dominating in the subtree of some vertex.

The subtree of vertex v is the vertex v and all other vertices that contains vertex v in each path to the root.

For each vertex v find the sum of all dominating colours in the subtree of vertex v.

Input

The first line contains integer n (1 ≤ n ≤ 105) — the number of vertices in the tree.

The second line contains n integers ci (1 ≤ ci ≤ n), ci — the colour of the i-th vertex.

Each of the next n - 1 lines contains two integers xj, yj (1 ≤ xj, yj ≤ n) — the edge of the tree. The first vertex is the root of the tree.

Output

Print n integers — the sums of dominating colours for each vertex.

Examples

input

Copy

4
1 2 3 4
1 2
2 3
2 4

output

Copy

10 9 3 4

input

Copy

15
1 2 3 1 2 3 3 1 1 3 2 2 1 2 3
1 2
1 3
1 4
1 14
1 15
2 5
2 6
2 7
3 8
3 9
3 10
4 11
4 12
4 13

output

Copy

6 5 4 3 2 3 3 1 1 3 2 2 1 2 3

 

题目大意：给出一颗有根树，每一个节点有一个颜色，要求统计任意一个子树中出现颜色最多的颜色之和。

解题思路：关于对静态子树的查询，考虑dsu on the tree 。

时间复杂度nlogn

#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define sca(x) scanf("%d",&x)
#define pb(x) push_back(x)

const int N = 1e5+5;

vector<int>V[N];
int son[N],sz[N],Son;
int a[N];
void dfs_1(int u,int fa)
{
    int mx=-1;
    sz[u]=1;
    for(auto v:V[u]){
        if(v!=fa){
            dfs_1(v,u);
            sz[u]+=sz[v];
            if(sz[v]>mx)mx=sz[v],son[u]=v;
        }
    }
}

int cnt[N];
LL sum,Max;
LL ou[N];

void cal(int u,int fa,int val)
{
    cnt[a[u]]+=val;
    if(cnt[a[u]]==Max)sum+=a[u];
    if(cnt[a[u]]>Max)
    {
        Max=cnt[a[u]];
        sum=a[u];
    }
    for(auto i:V[u]){
        if(i==fa||i==Son)continue;
        cal(i,u,val);
    }
}
int n;
void dfs(int u,int fa,int f)
{
    for(auto i:V[u]){
        if(i==fa||i==son[u])continue;
        dfs(i,u,1);
    }
    if(son[u])dfs(son[u],u,0),Son=son[u];
    cal(u,fa,1);
    ou[u]=sum;
    if(son[u])Son=0;
    if(f)cal(u,fa,-1),sum=0,Max=0;
}

int main()
{
    sca(n);
    for(int i=1;i<=n;i++)sca(a[i]);
    for(int i=0;i<n-1;i++)
    {
        int u,v;
        sca(u),sca(v);
        V[u].pb(v);
        V[v].pb(u);
    }

    dfs_1(1,0);
    dfs(1,0,0);
    for(int i=1;i<=n;i++)printf("%lld%c",ou[i],i==n?'\n':' ');
}