Submission #1195323

---

Source Code Expand

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

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

int N, M, Q;
VI G[100000];

void bfs(int u, int d, int c, VI& ans){
  queue<int> q;
  VI dist(N, 1e9);
  q.push(u);
  dist[u] = 0;

  while(!q.empty()){
	u = q.front();
	q.pop();

	if(dist[u] > d) continue;
	if(ans[u] == 0)
	  ans[u] = c;

	for(int to: G[u]){
	  if(dist[to] > dist[u]+1){
		q.push(to);
		dist[to] = dist[u]+1;
	  }
	}
  }
}

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

  cin >> N >> M;
  if(N > 2000 || M > 2000 || Q > 2000) return 1;
  REP(i,M){
	int a, b; cin >> a >> b;
	--a;
	--b;
	G[a].PB(b);
	G[b].PB(a);
  }
  cin >> Q;
  VI vs(Q), ds(Q), cs(Q);
  REP(q,Q){
	cin >> vs[q] >> ds[q] >> cs[q];
	--vs[q];
  }

  VI ans(N);
  for(int q=Q-1;q>=0;--q){
	bfs(vs[q], ds[q], cs[q], ans);
  }

  REP(i,N) cout << ans[i] << endl;

  return 0;
}

Submission Info

Judge Result