Submission #1195286

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <iomanip>

#include <map>
#include <set>
#include <queue>
#include <stack>

#define ALL(a) (a).begin(),(a).end()
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define rrep(i,n) RFOR(i,n,0)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define vint vector<int>
#define vdbl vector<double>
#define vstr vector<string>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

int colors[10001] = {};
vint edge[10001];

void dfs(int v,int d,int c){
	if(d == 0) return;

	rep(i,edge[v].size()){
		int u = edge[v][i];
		colors[u] = c;
		dfs(u,d-1,c);
	}
}

int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N,M;
	cin >> N >> M;

	rep(i,M){
		int a,b;
		cin >> a >> b;
		a--;
		b--;

		edge[a].push_back(b);
		edge[b].push_back(a);
	}

	int Q;
	cin >> Q;

	rep(i,Q){
		int v,d,c;
		cin >> v >> d >> c;
		v--;

		colors[v] = c;
		dfs(v,d,c);
	}

	rep(i,N){
		cout << colors[i] << endl;
	}

}

Submission Info

Judge Result