Submission #1369055

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair <int, int> pii;

#define fr first
#define sc second
#define pb push_back
#define mpr make_pair
#define ppb pop_back()
#define ins insert
#define sz(s) int(s.size())
#define all(x) x.begin(), x.end()
#define lb lower_bound
#define ub upper_bound
const int N = 2001;
int n, m, a, b, vi, di, ci, d[N], c[N];
vector <int> g[N];
queue <int> q;
int main()
{
	ios_base :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for(int i = 1;i <= m; ++ i){
		cin >> a >> b;
		g[a].pb(b);
		g[b].pb(a);
	}
	cin >> m;
	for(int i = 1;i <= m; ++ i){
		cin >> vi >> di >> ci;
		q.push(vi);
		for(int j = 1;j <= n; ++ j)d[j] = N;
		d[vi] = 0;
		while(sz(q)){
			int v = q.front();
			q.pop();
			if(d[v] <= di){
				c[v] = ci;
//				continue;
			}
			for(auto to : g[v]){
				if(d[to] > d[v] + 1){
					d[to] = d[v] + 1;
					q.push(to);
				}
			}
		}
	}
	for(int i = 1;i <= n; ++ i)cout << c[i] << endl;
	return 0;
}

Submission Info

Judge Result