Submission #1194617

---

Source Code Expand

#include<algorithm>
#include<cmath>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<sstream>
#include<vector>
using namespace std;
using uint = unsigned int;
using ll = long long;
const int M = 1e9 + 7;
const ll MLL = 1e18L + 9;
#pragma unused(M)
#pragma unused(MLL)
#ifdef LOCAL
#include"rprint.hpp"
#else
template <class... T> void printl(T&&...){ }
template <class... T> void printc(T&&...){ }
template <class... T> void prints(T&&...){ }
template <class... T> void printd(T&&...){ }
#endif

struct Node{
    int color = 0;
    vector<Node*> dests;
    void add(Node* n){
        dests.push_back(n);
    }
    void add2(Node* n){
        add(n);
        n->add(this);
    }
    void dfs(Node* from, int c, int rem){
        color = c;
        if(!rem){ return; }
        for(Node* d : dests){
            if(d == from){ continue; }
            d -> dfs(this, c, rem - 1);
        }
    }
};

int main(){
    int n, m;
    cin >> n >> m;
    vector<Node> nodes(n);
    for(int i=0;i<m;i++){
        int a, b;
        cin >> a >> b;
        a--; b--;
        nodes[a].add2(&nodes[b]);
    }
    int q; cin >> q;
    for(int i=0;i<q;i++){
        int v, d, c;
        cin >> v >> d >> c;
        v--;
        nodes[v].dfs(nullptr, c, d);
    }
    for(int i=0;i<n;i++){
        cout << nodes[i].color << '\n';
    }
    return 0;
}

Submission Info

Judge Result