Cod sursa(job #2768797)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 12 august 2021 11:25:25
Problema BFS - Parcurgere in latime Scor 90
Compilator c-64 Status done
Runda Arhiva educationala Marime 0.58 kb
#include<stdio.h>
#include<stdlib.h>
#define N 100001
#define 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]=(int*)malloc(w[i]*sizeof(int));
	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]);
    return 0;
}