Submission #1195289

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <iostream>
#include <set>
#include <map>
#include <queue>
#include <iomanip>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i++)
typedef long long ll;

int n, m, q;
vector<int> g[100005];
bool used[100005];
int color[100005];

void dfs(int v, int d, int c) {
	used[v] = true;
	color[v] = c;
	if (!d) return;
	FOR(i, g[v].size()) {
		int x = g[v][i];
		dfs(x, d-1, c);
	}
	return;
}

int main(int argc, char const *argv[]) {
	cin >> n >> m;
	FOR(i, m) {
		int a, b;
		cin >> a >> b;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	cin >> q;
	FOR(i, q) {
		int v, d, c;
		cin >> v >> d >> c;
		dfs(v, d, c);
	}
	for (int i = 1; i <= n; i++) cout << color[i] << endl;
	return 0;
}

Submission Info

Judge Result