Submission #1845346

---

Source Code Expand

#include <cstdio>
#include <iostream>
typedef std :: pair <int, int> pii;
typedef std :: pair <int, pii> piii;
inline int Get() {
	char ch;
	while ((ch = getchar()) < '0' || ch > '9');
	int Num = ch - '0';
	while ((ch = getchar()) >= '0' && ch <= '9')
		Num = (Num << 3) + (Num << 1) + ch - '0';
	return Num;
}
const int N = 1e5 + 5;
int n, m, Q, id[N], dist[N], col[N];
int tot, first[N], next[N << 1], end[N << 1];
int dep[N], val[N];
inline void AddEdge(int x, int y) {
	next[++tot] = first[x], first[x] = tot, end[tot] = y;
	next[++tot] = first[y], first[y] = tot, end[tot] = x;
}
void solve(int u, int dist, int col) {
	if (!val[u]) val[u] = col;
	if (dep[u] >= dist) return;
	
	dep[u] = dist;
	for (int k = first[u], v; v = end[k], k; k = next[k]) solve(v, dist - 1, col);
}
int main() {
	n = Get(), m = Get();
	for (int i = 1; i <= m; ++i) AddEdge(Get(), Get());
	
	Q = Get();
	for (int i = 1; i <= Q; ++i) id[i] = Get(), dist[i] = Get(), col[i] = Get();
	
	for (int i = Q; i; --i) solve(id[i], dist[i], col[i]);
	
	for (int i = 1; i <= n; ++i) printf("%d\n", val[i]);
	
	return 0;
}

Submission Info

Judge Result