Cod sursa(job #326349)

Utilizator cristikIvan Cristian cristik Data 24 iunie 2009 19:13:37
Problema BFS - Parcurgere in latime Scor 100
Compilator c Status done
Runda Arhiva educationala Marime 0.96 kb
#include <stdio.h>
#include <stdlib.h>
int n,i,j,*a[100001],m,s,x,y,c[100001],cost[100001];
char viz[100001];
void bfs(int x)
{
    int i,prim,ultim;
    viz[x]=1;
    c[0]=x;
    prim=ultim=0;
    while(prim<=ultim)
    {
        x=c[prim++];
        for(i=1; i<=a[x][0]; i++)
         if(!viz[a[x][i]])
         {

            viz[a[x][i]]=1;
            c[++ultim]=a[x][i];
            cost[a[x][i]]=cost[x]+1;
        }
    }
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d %d %d",&n,&m,&s);
    for(i=1; i<=n; i++)
    {
        a[i]=(int *)realloc(a[i],sizeof(int));
        a[i][0]=0;
    }
    for(i=0; i<m; i++)
    {
        scanf("%d %d",&x,&y);
        a[x][0]++;
        a[x]=(int *)realloc(a[x],(a[x][0]+1)*sizeof(int));
        a[x][a[x][0]]=y;
    }
    bfs(s);
    for(i=1; i<=n; i++)
     if(s!=i &&!cost[i]) printf("-1 ");
     else printf("%d ",cost[i]);
    return 0;
}