Cod sursa(job #1471184)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 13 august 2015 13:44:01
Problema BFS - Parcurgere in latime Scor 100
Compilator c Status done
Runda Arhiva educationala Marime 0.62 kb
#include<stdio.h>
#include<stdlib.h>
int n,m,s,d[100001],*g[100001],w[100001],a[1000010],b[1000010],q[1000010],p,u,i,j;
int main() {
	freopen("bfs.in","r",stdin),freopen("bfs.out","w",stdout),scanf("%d%d%d",&n,&m,&s);
	for(i=1;i<=m;i++)
    	scanf("%d%d",&a[i],&b[i]),w[a[i]]++;
	for(i=1;i<=n;w[i++]=0)
    	d[i]=100001,g[i]=(int*)malloc(w[i]*sizeof(int));
	for(i=1;i<=m;i++)
    	g[a[i]][w[a[i]]++]=b[i];
	d[s]=0,q[u++]=s;
	for(d[s]=0,q[u++]=s;p<u;)
    for(i=q[p++],j=0;j<w[i];j++)
    if(d[g[i][j]]>d[i]+1)
        d[g[i][j]]=d[i]+1,q[u++]=g[i][j];
	for(i=1;i<=n;i++)
    	printf("%d ",d[i]==100001?-1:d[i]);
}