Submission #1195313

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define fi first
#define se second
using namespace std;
typedef pair<int, int> P;

int n, m, q;
vector<int> G[100010];
int v[100010], d[100010], c[100010];
int color[100010];
bool f[100010];

void dfs(int now, int dist, int cl, int pre){
    if(dist < 0) return;
    if(f[now]) return;
    f[now] = true;
    color[now] = cl;
    rep(i, 0, G[now].size()){
        int next = G[now][i];
        if(next == pre) continue;
        dfs(next, dist - 1, cl, now);
    }
}

signed main(){
    cin >> n >> m;
    memset(color, 0, sizeof(color));
    assert(n <= 2000 && m <= 2000 && q <= 2000);
    rep(i, 0, m){
        int a, b;
        cin >> a >> b;
        a--; b--;
        G[a]. push_back(b);
        G[b]. push_back(a);
    }
    cin >> q;
    rep(i, 0, q){
        cin >> v[i] >> d[i] >> c[i];
        v[i]--;
        memset(f, 0, sizeof(f));
        dfs(v[i], d[i], c[i], -1);
    }
    rep(i, 0, n){
        cout << color[i] << endl;
    }
}

Submission Info

Judge Result