Submission #1195301

---

Source Code Expand

#include <bits/stdc++.h>
//#define Ak

using namespace std;

template< class t>
long long int gcd( t g,t h )
{
    return ( h==0 ? g : gcd(h,g%h) );
}

vector< int >v[100005];
int visit[100005]={0},color[100005]={0};

int dfs(int s,int d,int c)
{
    if(d<=0)
    {
        return 0;
    }
    
    if(visit[s]==1)
    {
        return 0;
    }
    
    visit[s]=1;
    color[s]=c;
    
    vector< int >::iterator k;
    
    for(k=v[s].begin();k!=v[s].end();k++)
    {
        if(visit[*k]==0)
        {
            color[*k]=c;
            dfs(*k,d-1,c);
        }
    }
    
    visit[s]=0;
    return 0;
    
}


int main()
{
   /* #ifdef Ak
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    	
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    */
    int q,n,m,i,j,ans=0,sum=0,a,b,s,d,c;
    
   // list< long long int >v;
   
   // map< long long int >m;
   
    cin>>n>>m;
    
    for(i=0;i<m;i++)
    {
        cin>>a>>b;
        a--;
        b--;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    
    cin>>q;
    
    while(q--)
    {
        cin>>s>>d>>c;
        s--;
        
        dfs(s,d,c);
        
    }
        
    for(i=0;i<n;i++)
    {
        cout<<color[i]<<endl;
    }
        
    return 0;
    
}

Submission Info

Judge Result