Submission #2099673

---

Source Code Expand

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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

const int M = 100000;
int n, m, q, v[M], d[M], c[M];
vector<int> g[M];
pair<int, int> ans[M];

int main() {
	cin >> n >> m;
	inc(i, m) {
		int a, b;
		cin >> a >> b;
		a--; b--;
		g[a].PB(b);
		g[b].PB(a);
	}
	cin >> q;
	inc(i, q) { cin >> v[i] >> d[i] >> c[i]; v[i]--; }
	
	inc(i, n) { ans[i] = MP(-1, -1); }
	dec(i, q) {
		queue<pair<int, int>> que;
		que.emplace(v[i], d[i]);
		while(! que.empty()) {
			auto p = que.front(); que.pop();
			if(p.SE < 0) { continue; }
			if(i <= ans[p.FI].FI && p.SE <= ans[p.FI].SE) { continue; }
			setmax(ans[p.FI].FI, i);
			setmax(ans[p.FI].SE, p.SE);
			for(auto && e: g[p.FI]) { que.emplace(e, p.SE - 1); }
		}
	}
	inc(i, n) { cout << (ans[i].FI == -1 ? 0 : c[ans[i].FI]) << "\n"; }
	
	return 0;
}

Submission Info

Judge Result