Cod sursa(job #366279)

Utilizator AndreiDDiaconeasa Andrei AndreiD Data 21 noiembrie 2009 14:02:50
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <cstdio>
#include <vector>

using namespace std;


#define file_in "bfs.in"
#define file_out "bfs.out"

#define Nmax 120309

int a,b,n,m,s,nod,x,p,u,i,q[Nmax],viz[Nmax],d[Nmax];
vector<int> v[Nmax]; 

int main()
{
	freopen(file_in,"r",stdin);
	freopen(file_out,"w",stdout);
	
	scanf("%d %d %d", &n, &m,&s);
	
	while(m--)
	{
		scanf("%d %d", &a, &b);
		
		v[a].push_back(b);
		
	}
	
	
	memset(d,-1,sizeof(d));
	
	q[1]=s;
	d[s]=0;
	
	p=u=1;
	
	while(p<=u)
	{
		nod=q[p++];
		
		for (i=0;i<v[nod].size();++i)
			 if (d[v[nod][i]]==-1)
			 {
				 d[v[nod][i]]=d[nod]+1;
				 q[++u]=v[nod][i];
			 }
	}
	
	
	for (i=1;i<=n;++i)
		 printf("%d ", d[i]);
	
	fclose(stdin);
	fclose(stdout);
	
	return 0;
}