Submission #1195318

---

Source Code Expand

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

bool vis[MAXN];
int col[MAXN],d;
vector<int>adj[MAXN];
queue<pair<int,int>>q;

void bfs(int node,int cl,int dist){
	while(!q.empty()){
		while(vis[q.front().first]==true){
			q.pop();
			if(q.empty())
				return ;
		}
		int node=q.front().first;
		int dist=q.front().second;
		if(dist>d)
			q.pop();
		else{
			col[node]=cl;
			for(int i=0;i<adj[node].size();i++){
				int child=adj[node][i];
				if(!vis[child]){
					q.push(mp(child,dist+1));
				}
			}
			q.pop();
		}
	}
}

int main(){
	int n,m,q1,u,v,c;
	cin>>n>>m;
	for(int i=0;i<m;i++){
		cin>>u>>v;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	cin>>q1;
	for(int i=0;i<q1;i++){
		cin>>v>>d>>c;
		q.push(mp(v,0));
		bfs(v,c,0);
		fill(vis,vis+n+5,false);
	}
	for(int i=1;i<=n;i++){
		cout<<col[i]<<endl;
	}
	return 0;
}

Submission Info

Judge Result