Submission #1456585

---

Source Code Expand

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

long long N, M, Q;
vector<long long> tree[100005];
long long v[100005];
long long d[100005];
long long c[100005];
long long ans[100005];


set<pair<long long, long long> > done;

void paint(long long node, long long dis, long long col){
	if(done.count(make_pair(node, dis)) != 0){
		return;
	}
	done.insert(make_pair(node, dis));
	if(ans[node] == 0){
		ans[node] = col;
	}
	if(dis == 0){
		return;
	}
	for(long long i = 0; i < tree[node].size(); i++){
		paint(tree[node][i], dis - 1, col);
	}
}


int main(){
	cin >> N >> M;
	for(long long i = 0; i < M; i++){
		long long a, b;
		cin >> a >> b;
		a--;b--;
		tree[a].push_back(b);
		tree[b].push_back(a);
		//cin >> a[i] >> b[i];
	}
	cin >> Q;

	for(long long i = Q-1; i >= 0; i--){
		cin >> v[i] >> d[i] >> c[i];
	}

	for(long long i = 0; i < Q; i++){
		paint(v[i] - 1, d[i], c[i]);
	}

	for(long long i = 0; i < N; i++){
		cout << ans[i] << endl;
	}


}

Submission Info

Judge Result