Submission #1368918

---

Source Code Expand

#include <bits/stdc++.h>
 
#define pii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long 
#define ld long double
#define sz(v) int(v.size())
#define all(v) v.begin(), v.end()
 
#define y1 what

using namespace std;
 
const int N = (int) 2e5 + 10;
const int M = (int) 18;
const ll big =  (1LL << 51);
const ll LINF = (ll) 1e18;
const int INF = (int) 1e9 + 7;
const double EPS = (double) 1e-6;
const double PI =  3.14159265359;

int n, m, q;
int a[N], b[N], c[N];
vector<int> v[N];
int was[N];

void dfs(int x, int mx, int clr) {
    if (mx < 0) 
        return;
    if (!was[x]) {
        was[x] = clr;
    }
    for (auto it : v[x]) {
        dfs(it, mx - 1, clr);
    }
}

int main() {
    #define fn "balls"
    #ifdef witch
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #else
//        freopen(fn".in", "r", stdin);
//        freopen(fn".out", "w", stdout);
    #endif
    srand(time(0));
    cin >> n >> m;
    while (m--) {
        int x, y;
        cin >> x >> y;
        v[x].pb(y);
        v[y].pb(x);
    }
    cin >> q;
    for (int i = 1; i <= q; i++) {
        cin >> a[i] >> b[i] >> c[i];
    }
    for (int i = q; i >= 1; i--) {
        dfs(a[i], b[i], c[i]);
    }
    for (int i = 1; i <= n; i++) {
        cout << was[i] << "\n";
    }
    return 0;
}   

Submission Info

Judge Result