Submission #1370227

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define forn(i, s, f) for(int i = (s); i <= (f); ++i)
#define for1(i, f, s) for(int i = (f); i >= (s); --i)
#define fora(i, x) for (auto i : x)
#define show(x) cout << #x << " = " << x << " ";
#define skip continue;
#define pb push_back
#define _1 first
#define _2 second

typedef long long ll;

const int N3 = 1e3 + 5;
const int N4 = 1e4 + 5;
const int N5 = 1e5 + 5;
const int N6 = 1e6 + 5;
const int N7 = 1e7 + 5;
const int N8 = 1e8 + 5;
const int N9 = 1e9 + 5;

map < pair < int, int >, int > used;

int color[N5];

int n, m, x, q, y, v[N5], d[N5], c[N5];

int clr;

vector < int > g[N5];

void dfs(int v, int d)
{
    used[{v, d}] = 1;
    if (!color[v])
        color[v] = clr;
    if (d == 0)
    return;
    if (!used[{v, d - 1}])
        dfs(v, d - 1);
    fora (to, g[v])
    {
        if (!used[{to, d - 1}])
            dfs(to, d - 1);
    }
}

int main()
{
    cin >> n >> m;
    forn (i, 1, m)
    {
        cin >> x >> y;
        g[x].pb(y);
        g[y].pb(x);
    }
    cin >> q;
    forn (i, 1, q)
    {
        cin >> v[i] >> d[i] >> c[i];
    }
    for1 (i, q, 1)
    {
        clr = c[i];
        if (!used[{v[i], d[i]}])
            dfs(v[i], d[i]);
    }
    forn (i, 1, n)
    {
        cout << color[i] << "\n";
    }
}

Submission Info

Judge Result