Submission #1195297

---

Source Code Expand

/* In the name of Allah
   The most beneficent,
   The most merciful
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
#define ck puts("ok")
#define reset(a,d) memset(a,d,sizeof(a))
#define CASE(i) printf("Case %lld: ", i)
#define pb(a,b) a.push_back(b)
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define min4(a,b,c,d) min(min(a,b),min(c,d))
#define max4(a,b,c,d) max(max(a,b),max(c,d))
#define DIST(x1,y1, x2, y2) (((x1-x2)*(x1-x2))+((y1-y2)*(y1-y2)))
#define DIST3D(x1,x2, y1, y2, z1, z2) (((x1-x2)*(x1-x2))+((y1-y2)*(y1-y2)) + ((z1-z2)*(z1-z2)))
#define ALL(x) (x).begin(),(x).end()
#define LLA(x) x.rbegin(), x.rend()
#define SORT(v) sort(ALL(v))
#define inf   1<<30
#define mod   1000000007
#define PI acos(-1.0)
string sss="0123456789ABCDEF";
//-----------------------------------------------------------//
vector<ll>G[100009];
ll col[100009],dis;
bool vis[100009];
void dfs(ll n,ll dur,ll rong)
{
    if(dur>dis||vis[n])return ;
    col[n]=rong;
    ll sz=G[n].size();
    for(int i=0; i<sz; i++)
    {
        ll now=G[n][i];
        if(vis[now])continue;
        dfs(now,dur+1,rong);
    }
}
void dfsvis(ll n)
{
    if(vis[n]==0)return;
    vis[n]=0;
    ll sz=G[n].size();
    for(int i=0; i<sz; i++)
    {
        ll now=G[n][i];
        if(vis[now]==0)continue;
        dfsvis(now);
    }
}
int main()
{
    ll n,m,i,x,y,q,a,cl;
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y;
        pb(G[x],y);
        pb(G[y],x);
    }
    cin>>q;
    while(q--)
    {
        cin>>x>>dis>>cl;
        dfs(x,0,cl);
        dfsvis(x);
    }
    for(i=1;i<=n;i++)cout<<col[i]<<endl;
}

Submission Info

Judge Result