Submission #1825722

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<iomanip>
#include<set>
#include<queue>
#define sqr(x) (x)*(x)
using namespace std;
int n,m,i,j,col[100005],vis[100005],ans[100005],x,y;
set<int> s[100005];
vector<int> bi[100005];
priority_queue<pair<int,int>/**/> pq;
int main()
{
	cin>>n;
	for (i=1;i<n;i++)
	{
		cin>>x>>y;
		bi[x].push_back(y);
		bi[y].push_back(x);
	}
	cin>>m;
	for (i=1;i<=m;i++)
	{
		cin>>x>>y;
		ans[x]=y;
		vis[x]=1;
		pq.push(make_pair(y,x));
	}
	/*col[1]=1;
	if (!dfs(1))
	{
		cout<<"No";
		return 0;
	}*/
	//cout<<"Yes"<<endl;
	while (!pq.empty())
	{
		y=pq.top().first;x=pq.top().second;
		pq.pop();
		for (i=0;i<bi[x].size();i++)
		{
			if (vis[bi[x][i]]) continue;
			vis[bi[x][i]]=1;
			ans[bi[x][i]]=y-1;
			pq.push(make_pair(y-1,bi[x][i]));
		}
	}
	for (i=1;i<=n;i++)
	{
		for (j=0;j<bi[i].size();j++)
		{
			if (abs(ans[bi[i][j]]-ans[i])!=1)
			{
				cout<<"No";
				return 0;
			}
		}
	}
	cout<<"Yes"<<endl;
	for (i=1;i<=n;i++) cout<<ans[i]<<endl;
	return 0;
}

Submission Info

Judge Result