Cod sursa(job #2306432)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 22 decembrie 2018 12:41:35
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.51 kb
#include<cstdio>
const int N=100001,M=1000000;
int s[N],c[N],*a[N],w[N],n,m,l=1,o,i,x[M],y[M],j;
int main()
{
	freopen("bfs.in","r",stdin),freopen("bfs.out","w",stdout),scanf("%d%d%d",&n,&m,&o);
	for(i=0;i<m;i++)
		scanf("%d%d",&x[i],&y[i]),w[x[i]]++;
	for(i=1;i<=n;w[i++]=0)
		c[i]=-1,a[i]=new int[w[i]];
	for(i=0;i<m;i++)
		a[x[i]][w[x[i]]++]=y[i];
	for(c[o]=0,s[l]=o,i=1;i<=l;i++)
		for(j=0;j<w[s[i]];j++)
			if(c[a[s[i]][j]]==-1)
				s[++l]=a[s[i]][j],c[s[l]]=c[s[i]]+1;
	for(i=1;i<=n;i++)
		printf("%d ",c[i]);
}