Submission #1520979

---

Source Code Expand

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

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)
int DP[100005][10];
typedef vector<int> Edges;
Edges G[100005];

void dfs(int v, int d, int t){
    if(DP[v][d]==-1){
        DP[v][d] = t;
    }
    if(d>0){
        REP(i, G[v].size()){
            dfs(G[v][i], d-1, t);
        }
        dfs(v, d-1, t);
    }
}


int main(){
    int N, M;
    cin >> N >> M;
    REP(i, M){
        int a, b;
        cin >> a >> b;
        a--;b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    int Q;
    cin >> Q;
    int c[Q], d[Q], v[Q];
    REP(i, Q){
        cin >> v[Q-1-i] >> d[Q-1-i] >> c[Q-1-i];
        v[Q-1-i]--;
    }
    REP(i, N) REP(j, 10) DP[i][j] = -1;
    REP(i, Q){
        dfs(v[i], d[i], i);
    }
    REP(i, N){
        cout <<(DP[i][0]!=-1 ? c[DP[i][0]] : 0) << endl;
    }
    return 0;
}

Submission Info

Judge Result