提出 #73928534

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using pii = pair<int,int>;

void solveA () {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i ++) {
   int x;
   cin >> x;
   if (x < m) {
    m = x;
    cout << 1 << endl;
   } else cout << 0 << endl;
  }
}

void solveB () {
  int n, m;
  cin >> n >> m;
  vector<int> c(m + 1);
  for (int i = 1; i <= m; i ++) cin >> c[i];
  int ans = 0;
  while (n --) {
    int a, b;
    cin >> a >> b;
    int diff = 0;
    if (b > c[a]) {
      diff = c[a];
      c[a] = 0;
    }
    else {
      c[a] -= b;
      diff = b;
    }
    ans += diff;
  }
  cout << ans << endl;
}
 
void solveC () {
  int n, q;
  cin >> n >> q;
  vector<int> value(n + 1);
  priority_queue<pii, vector<pii>, greater<pii>> pq;
  for (int i = 0; i < n; i ++) {
    int val;
    cin >> val;
    value[i + 1] = val;
    pq.push({val, i + 1});
  }
  while (q --) {
    int k;
    cin >> k;
    set<int> s;
    for (int i = 0; i < k; i ++) {
      int x;
      cin >> x;
      s.insert(x);
    }
    while (!pq.empty()) {
      auto&[val, index] = pq.top();
      if (s.find(index) != s.end()) pq.pop();
      else {
        cout << val << endl;
        break;
      }
    }
    for (auto& x : s) {
      pq.push({value[x], x});
    }
  }
}

 void solveD () {
  int n;
  cin >> n;
  vector<int> w(n + 1);
  for (int i = 1; i <= n; i ++) cin >> w[i];
  auto G = vector(n + 1, vector<int> ());
  for (int i = 1; i <= n - 1; i ++) {
    int u, v;
    cin >> u >> v;
    G[u].push_back(v);
  }
  vector<bool> ans (n + 1);
  multiset<int> vis;
  vis.insert(w[1]);
  auto traceback = [&] (auto&& self, int u) -> void {
    for (auto& v : G[u]) {
      if (vis.find(w[v]) != vis.end()) ans[v] = 1;
      vis.insert(w[v]);
      self(self, v);
      vis.erase(vis.find(w[v]));
    }
  };
  traceback(traceback, 1);
  for (int i = 1; i <= n; i ++) {
    cout << (ans[i] ? "Yes" : "No") << endl;
  }
 }
int main () {
 solveD();
}

提出情報

ジャッジ結果