Submission #1195351

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long  ll;
const int N = 1e5 + 5;
const int M = 1e9 + 7;
vector <int> v[N];
int color[N];

int main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int n, m, x, y, q;
    cin >> n >> m;
    for(int i = 0; i < m; i++) {
        cin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    cin >> q;
    while(q--) {
        int u, d, c;
        cin >> u >> d >> c;
        queue <int> qu;
        bool visit[N];
        int level[N];
        memset(level, 0, sizeof(level));
        memset(visit, false, sizeof(visit));
        qu.push(u);
        color[u] = c;
        visit[u] = true;
        level[u] = 1;
        while(!qu.empty()) {
            int j = qu.front();
            if(level[j] == d + 1)
                break;
            qu.pop();
            for(int i = 0; i < v[j].size(); i++) {
                if(!visit[v[j][i]]) {
                    qu.push(v[j][i]);
                    color[v[j][i]] = c;
                    level[v[j][i]] = level[j] + 1;
                    visit[v[j][i]] = true;;
                }
            }
        }
        while(!qu.empty()) {
            qu.pop();
        }
    }
    for(int i = 1; i <= n; i++)
        cout << color[i] << "\n";
}

Submission Info

Judge Result