Submission #1195349

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int A[100001][11][2];
int main() {
	int N, M;
	cin >> N >> M;
	vector<pair<int,int>> E;
	for (int i = 0; i < M; ++ i) {
		int a, b;
		cin >> a >> b;
		-- a; -- b;
		E.push_back({a,b});
	}
	int Q;
	cin >> Q;
	for (int i = 1; i <= Q; ++ i) {
		int v, d, c;
		cin >> v >> d >> c;
		-- v;
		A[v][d][0] = c;
		A[v][d][1] = i;
	}
	for (int d = 10; d >= 1; -- d) {
		for (auto p : E) {
			int a = p.first;
			int b = p.second;
			for (int k = 0; k < 2; ++ k) {
				if (A[a][d][1]) {
					if (A[b][d-1][1] < A[a][d][1]) {
						// cerr << a << " " << b << " " << d << endl;
						A[b][d-1][0] = A[a][d][0];
						A[b][d-1][1] = A[a][d][1];
					}
				}
				swap(a, b);
			}
		}
	}
	for (int i = 0; i < N; ++ i) {
		int c = 0;
		int t = 0;
		for (int d = 0; d <= 10; ++ d) {
			if (A[i][d][1] > t) {
				c = A[i][d][0];
				t = A[i][d][1];
			}
		}
		cout << c << endl;
	}
}

Submission Info

Judge Result