Submission #1369034

---

Source Code Expand

/*
ID: 5ak0
PROG:
LANG: C++11
*/

#include <bits/stdc++.h>
#define fr first
#define sc second
#define pb push_back
#define mpr make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 7, MAXN = 2010;

int n, m, a, b, q, x, v, d, c[MAXN];
vector <int> g[MAXN];

void dfs(int v, int lvl){
    c[v] = x;
    for (auto to : g[v])
        if (c[to] != c[v]){
            if (lvl - 1 < 0)
                return;
            dfs(to, lvl - 1);
        }
}

int main(){
    #ifndef SAKO
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    #endif // SAKO
    ios_base::sync_with_stdio(0);

    cin >> n >> m;
    for (int i = 1; i <= m; ++i){
        cin >> a >> b;
        g[a].pb(b);
        g[b].pb(a);
    }
    cin >> q;
    for (int i = 1; i <= q; ++i){
        cin >> v >> d >> x;
        dfs(v, d);
    }
    for (int i = 1; i <= n; ++i)
        cout << c[i] << "\n";
    return 0;
}

Submission Info

Judge Result