CodeForces 600E Lomsat gelral 暴力

给出一颗树，对于点v，color[v]表示v的颜色，dominating_color[v]表示v子树中color[v]出现次数最多的那个color[v]，求sigma(其中x是v的后代){dominating_color[x]}。

map暴力233。

#include <cstdio>
#include <map>
#include <algorithm>
using std::map; using std::swap;
const int N = 100001, M = 2 * N;
typedef long long ll;

int head[N], next[M], to[M], cnt = 0;
ll ans[N];
int color[N], n;

void add(int u, int v) {
    next[++cnt] = head[u]; head[u] = cnt; to[cnt] = v;
}

struct State {
    map<int, int> m;
    int cnt; ll sum;
};

State dfs(int u, int fa) {
    State res;
    res.m[color[u]]++;
    res.cnt = 1;
    res.sum = color[u];

    for (int i = head[u]; i; i = next[i]) {
        if (to[i] == fa) continue;
        State sta = dfs(to[i], u);
        if (sta.m.size() > res.m.size()) {
            swap(sta.m, res.m);
            res.cnt = sta.cnt;
            res.sum = sta.sum;
        }
        for (auto it : sta.m) {
            int appear = res.m[it.first] += it.second;
            if (appear > res.cnt) {
                res.cnt = appear;
                res.sum = it.first;
            } else if (appear == res.cnt) {
                res.sum += it.first;
            }
        }
    }

    ans[u] = res.sum;

    return res;
}

int main() {
    scanf("%d", &n);

    for (int i = 1; i <= n; i++) scanf("%d", color + i);
    for (int i = 1, x, y; i < n; i++) {
        scanf("%d %d", &x, &y);
        add(x, y); add(y, x);
    }
    dfs(1, 0);
    for (int i = 1; i <= n; i++)
        printf("%I64d ", ans[i]);
    return 0;
}

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 vmore 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.

Sample test(s)

input

4
1 2 3 4
1 2
2 3
2 4

output

10 9 3 4

input

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

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