Cod sursa(job #263645)

Utilizator RaduStefRadu Teodosescu RaduStef Data 20 februarie 2009 18:42:39
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include<stdio.h>
const int M=1000007;
const int N=100007;
int n,*a[N],d[N],x0;
void citire(){
	int x[M],y[M],m,i;
	scanf("%d%d%d",&n,&m,&x0);
	for(i=1;i<=m;++i)
	{
		scanf("%d%d",&x[i],&y[i]);
		++d[x[i]];
	}
	for(i=1;i<=n;++i)
	{
		a[i]= new int[1+d[i]];
		a[i][0]=0;
	}
	for(i=1;i<=m;++i)
		a[x[i]][++a[x[i]][0]]=y[i];
}
void bfs(int x0)
{
	int p,u,coada[N],x,y,i;
	for(i=1;i<=n;i++)
		d[i]=-1;
	p=u=0;
	coada[u++]=x0;
	d[x0]=0;
	while(p!=u)
	{
		x=coada[p++];
		for(i=1;i<=a[x][0];++i)
		{
			y=a[x][i];
			if(d[y]==-1){
				coada[u++]=y;
				d[y]=1+d[x];
			}
		}
	}
	for(i=1;i<=n;i++){
		printf("%d",d[i]);
		printf(" ");
	}
}
int main(){
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	citire();
	bfs(x0);
	return 0;
	printf("\n");
}