Submission #73920340

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
const ll N = 2e5 + 5, MOD = 998244353, inf = 2e18;
using namespace std;
int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
char di[] = {'R', 'L', 'D', 'U'};
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

void Ebraam() {
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
#ifndef ONLINE_JUDGE
    freopen("Input.txt", "r", stdin);
    freopen("Output.txt", "w", stdout);
#endif
}

void solve() {
    int n;
    cin >> n;
    vector<int> adj[n + 5], a(n), ans(n + 1, 0);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    map<int, int> mp;
    int cnt = 0;
    function<void(int, int)> dfs = [&](int u, int p)-> void {
        mp[a[u - 1]]++;
        cnt += mp[a[u - 1]] == 2;
        ans[u] |= cnt;
        for (auto v: adj[u]) {
            if (v == p)continue;
            dfs(v, u);
        }
        if (mp[a[u - 1]] == 2)cnt--;
        mp[a[u - 1]]--;
    };
    dfs(1, -1);
    for (int i = 1; i <= n; i++) {
        cout << (ans[i] ? "Yes" : "No") << '\n';
    }
}

int main() {
    Ebraam();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        if (t)cout << endl;
    }
    return 0;
}

Submission Info

Judge Result