Submission #1195002

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef  long long ll;
typedef unsigned long long ull;
int inf_int=1e9;
ll inf_ll=1e16;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define pb push_back
const double pi=3.1415926535898;
#define dout if(debug) cout
#define fi first
#define se second
#define sp setprecision
#define siz(a) a.size()
#define EPS 1e-7
#define next asdfafgasgasg
bool debug=0;
typedef long double dbl;
const int MAXN = 2e5;
const int MOD = 1e9 +7;



vector<int> g[MAXN];
pii val[MAXN][11];
void solve()
{
    int n;
    cin >> n;
    int m;
    cin >> m;
    for(int i=1;i<=m;++i){
        int a,b;
        cin >> a >> b;
        g[a].pb(b);
        g[b].pb(a);
    }

    int q;
    cin >> q;
    for(int j=1;j<=q;++j){
        int d,v,c;
        cin >> v >> d >> c ;
        val[v][d]={j,c};
    }

    for(int d=10;d>=1;d--){
        for(int v=1;v<=n;v++){
            for(int to:g[v]){
                val[to][d-1]=max(val[to][d-1],val[v][d]);
            }
            val[v][d-1]=max(val[v][d-1],val[v][d]);
        }

    }

    for(int i=1;i<=n;++i){
        if(i>1){
            cout <<"\n";
        }
        cout << val[i][0].se;

    }
    cout <<"\n";

}


#define FILE "palindrome"
int main()
{
        #ifdef zxc
            freopen("input.txt","r",stdin);
 //          freopen("output.txt","w",stdout);
        #else
         //     freopen(FILE".in","r",stdin);
         //     freopen(FILE".out","w",stdout);
        #endif // zxc

     //  freopen(FILE".in","r",stdin);
     //   freopen(FILE".out","w",stdout);

     //   freopen("input.txt","r",stdin);
       // freopen("output.txt","w",stdout);

       if(!debug)
       {
            ios_base::sync_with_stdio(0);
            cin.tie(0);
            cout.tie(0);
       }

        int t=1;
        while(t--)
           solve();
        return 0;
}

Submission Info

Judge Result