Submission #1372340

---

Source Code Expand

#include <iostream>
#include <vector>
#include <list>

int main() {
  unsigned N;
  std::cin >> N;
  std::vector<std::vector<unsigned>> G(N);
  for (unsigned i = 0; i < N - 1; ++i) {
    unsigned x, y;
    std::cin >> x >> y;
    --x; --y;
    G[std::min(x, y)].push_back(std::max(x, y));
  }
  unsigned K;
  std::cin >> K;
  std::vector<std::pair<int, int>> color(N);
  for (auto &i : color) {
    i.first = std::numeric_limits<int>::min() / 2;
    i.second = std::numeric_limits<int>::max() / 2;
  }
  for (unsigned i = 0; i < K; ++i) {
    unsigned x, y;
    std::cin >> x >> y;
    --x;
    color[x] = std::make_pair(y, y);
  }
  std::vector<int> even_odd(N, -1);
  for (unsigned i = 0; i < N; ++i) {
    if (color[i].first == color[i].second) {
      if (even_odd[i] < 0) {
        even_odd[i] = color[i].first % 2;
      } else {
        if (even_odd[i] != color[i].first % 2) {
          std::cout << "No";
          return 0;
        }
      }
    }
    int x = color[i].first % 2 ? 0 : 1;
    for (auto e : G[i]) {
      if (even_odd[i] < 0) {
        even_odd[i] = x;
      } else {
        if (even_odd[i] == even_odd[e]) {
          std::cout << "No";
          return 0;
        }
      }
    }
  }
  for (unsigned i = N; i-- > 0;) {
    for (auto e : G[i]) {
      color[i].first = std::max(color[i].first, color[e].first - 1);
      color[i].second = std::min(color[i].second, color[e].second + 1);
    }
    if (color[i].first % 2 != even_odd[i]) {
      ++color[i].first;
    }
    if (color[i].second % 2 != even_odd[i]) {
      --color[i].second;
    }
    if (color[i].first > color[i].second) {
      std::cout << "No" << std::endl;
      return 0;
    }
  }
  std::cout << "Yes" << std::endl;
  for (unsigned i = 0; i < N; ++i) {
    for (auto e : G[i]) {
      if (color[e].first <= color[i].first - 1) {
        color[e].first = color[i].first - 1;
      } else {
        color[e].first = color[i].first + 1;
      }
    }
    std::cout << color[i].first << std::endl;
  }
  return 0;
}

Submission Info

Judge Result