Submission #1369072

---

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], d[N];
vector<int> v[N];
int mx[N];
 
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 = n; i >= 1; i--) {
        mx[i] = 0;
    }
    for (int i = q; i >= 1; i--) {
        for (int j = 1; j <= n; j++) {
            d[j] = INF;
        }
        queue<int> q;
        q.push(a[i]);
        d[a[i]] = 0;
        while (!q.empty()) {
            int fr = q.front(); q.pop();
            mx[fr] = max(mx[fr], i);
            if (d[fr] == b[i])
                continue;
            for (auto it : v[fr]) {
                if (d[fr] + 1 < d[it]) {
                    d[it] = d[fr] + 1;
                    q.push(it);
                }
            }
        }   
    }
    for (int i = 1; i <= n; i++) {
        cout << c[mx[i]] << "\n";
    }
    return 0;
}

Submission Info

Judge Result