Submission #1835685

---

Source Code Expand

#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#ifdef int
const ll INF = (1LL<<60);
#else
const int INF = (1LL<<30);
#endif
const double PI = 3.14159265359;
const double EPS = 1e-12;
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
  out<<'('<<a.first<<','<<a.second<<')';
  return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

VI g[100010];
int p[100010];
PII x[100010];
int rn;

PII dfs(int v, int par, int d) {
  if(g[v].size() == 1 && par != -1) {
    if(p[v] == -1) {
      x[v] = {-INF, INF};
    } else {
      x[v] = {p[v], p[v]};
      if(abs(p[v] - rn)%2 != d%2) x[v] = {INF, -INF};
    }
    // cout << v << " " << x[v] << endl;
    return x[v];
  } else {
    PII ret = {-INF, INF};
    for(int i: g[v]) {
      if(i == par) continue;
      PII tmp = dfs(i, v, d+1);
      // tmp.first-1 から tmp.second+1
      if(ret.first < tmp.first-1) ret.first = tmp.first-1;
      if(ret.second > tmp.second+1) ret.second = tmp.second+1;
    }
    if(ret.first > ret.second) ret = {INF, -INF};
    if(p[v] != -1) {
      if(ret.first > p[v] || p[v] > ret.second) ret = {INF, -INF};
      else if(abs(p[v] - rn)%2 != d%2) ret = {INF, -INF};
      else ret = {p[v], p[v]};
    }
    // cout << v << " " << ret << endl;
    return x[v] = ret;
  }
}

void dfs2(int v, int par, int d) {
  for(int i: g[v]) {
    if(i == par) continue;
    // p[v]-1 と p[v]+1のどっちを入れるか？
    if(x[i].first <= p[v]-1 && p[v]-1 <= x[i].second) p[i] = p[v]-1;
    else if(x[i].first <= p[v]+1 && p[v]+1 <= x[i].second) p[i] = p[v]+1;
    else assert(false);
    dfs2(i, v, d+1);
  }
}

signed main(void)
{
  int n, k;
  cin >> n;
  REP(i, n-1) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    g[a].PB(b);
    g[b].PB(a);
  }
  memset(p, -1, sizeof(p));
  int root;
  cin >> k;
  REP(i, k) {
    int a, b;
    cin >> a >> b;
    a--;
    p[a] = b;
    root = a; rn = b;
  }

  PII ret = dfs(root, -1, 0);
  if(ret.first > ret.second) cout << "No" << endl;
  else {
    cout << "Yes" << endl;
    dfs2(root, -1, 0);
    REP(i, n) cout << p[i] << endl;
  }

  return 0;
}

Submission Info

Judge Result