Submission #73929374

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main()
{
    cin.tie(0)->sync_with_stdio(0);

    int n;
    cin >> n;
    vector<int> num(n);
    for (int i = 0; i < n; i++)
    {
        cin >> num[i];
    }

    vector<vector<int>> edge(n);
    for (int i = 0; i < n - 1; i++)
    {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        edge[u].push_back(v);
        edge[v].push_back(u);
    }

    vector<bool> ans(n, false);
    unordered_map<int, int> cnt;
    function<void(int, int)> dfs;
    dfs = [&](int cur, int parent)
    {
        int val = num[cur];
        cnt[val]++;

        if (parent != -1)
            ans[cur] = ans[parent];
        if (cnt[val] >= 2)
            ans[cur] = true;

        for (int x : edge[cur])
        {
            if (x == parent)
                continue;
            dfs(x, cur);
        }

        cnt[val]--;
        if (cnt[val] == 0)
            cnt.erase(val);
    };

    dfs(0, -1);

    for (int i = 0; i < n; i++)
    {
        cout << (ans[i] ? "Yes" : "No") << '\n';
    }

    return 0;
}

Submission Info

Judge Result