Submission #1313357

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define pb push_back

int n,m;
vector <vector <int> > v;
vector<int > vercol;

void BFS(int s,int depth,int col)
{
    bool visited[n];
    int ranks[n] = {0}; 
    for(int i = 0; i < n; i++)
        visited[i] = false;
     list<int> queue;
    visited[s] = true;
    queue.push_back(s);
    ranks[s]=1;
 	vercol[s]=col;
    while(!queue.empty())
    {
        s = queue.front();
        queue.pop_front();
        if (ranks[s] > depth ) {
        	return;
        }

        for(auto c:v[s])
        {
        	  
            if(!visited[c])
            {
                visited[c] = true;
                vercol[c] = col;
                queue.push_back(c);
                ranks[c] = ranks[s]+1;
            }
        }
    }
}
 

int main(){
	int a,b,c,t;
	cin>>n>>m;
	v.resize(n);
	vercol.resize(n);
	for(int i=0;i<m;i++){
		cin>>a>>b;
		a--;b--;
		v[a].pb(b);
		v[b].pb(a);
	}
	cin>>t;
	while(t--){
		cin>>a>>b>>c;
		BFS(a-1,b,c);
	}
		for(int i=0;i<n;i++){
		cout<<vercol[i]<<endl;
	}
	return 0;
}

Submission Info

Judge Result