Submission #2117655

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <functional>
#include <utility>
#include <tuple>
#include <cctype>
#include <bitset>
using namespace std;
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3fLL
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pint;
typedef pair<ll,ll> pll;
typedef tuple<int,int,int> tint;
typedef vector<int> vint;
typedef vector<ll> vll;
int dx[8]={0,0,-1,1,1,1,-1,-1};
int dy[8]={-1,1,0,0,1,-1,1,-1};
const int SIZE=100050;
//ここまでテンプレ
int main(){
	int N;
	cin>>N;
	vint node[SIZE];
	for(int i=0;i<N-1;i++){
		int a,b;
		cin>>a>>b;
		a--,b--;
		node[a].pb(b);
		node[b].pb(a);
	}
	int K;
	cin>>K;
	int num[SIZE]={};
	for(int i=0;i<N;i++)
		num[i]=INF;
	priority_queue<pint,vector<pint>,greater<pint>> que;
	for(int i=0;i<K;i++){
		int v,p;
		cin>>v>>p;
		v--;
		num[v]=p;
		que.push(mp(p,v));
	}
	while(que.size()){
		int v,p;
		tie(p,v)=que.top();
		que.pop();
		for(int i:node[v]){
			if(num[i]==INF){
				num[i]=p+1;
				que.push(mp(p+1,i));
			}
			else if(num[i]!=num[v]+1 && num[i]!=num[v]-1){
				cout<<"No"<<endl;
				return 0;
			}
		}
	}
	cout<<"Yes"<<endl;
	for(int i=0;i<N;i++)
		cout<<num[i]<<endl;
	return 0;
}

Submission Info

Judge Result