Cod sursa(job #307204)

Utilizator DraStiKDragos Oprica DraStiK Data 23 aprilie 2009 17:56:08
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <stdio.h>
#define DIM 1000005
struct nod {int x;
            nod *urm;} *lst[DIM];
int viz[DIM/10],cost[DIM/10],c[DIM/10];
int n,m,s,in,sf;
void add (int a,int b)
{
    nod *p=new nod;
    p->x=b;
    p->urm=lst[a];
    lst[a]=p;
}
void bf (int val)
{
    nod *p;
	viz[val]=1;
	for (c[in=sf=1]=val; in<=sf; ++in)
        for (p=lst[c[in]]; p; p=p->urm)
            if (!viz[p->x])
            {
                viz[p->x]=1;
                c[++sf]=p->x;
				cost[p->x]=cost[c[in]]+1;
            }
}
int main ()
{
    freopen ("bfs.in","r",stdin);
    freopen ("bfs.out","w",stdout);
    int i,x,y;
    scanf ("%d%d%d",&n,&m,&s);
    for (i=1; i<=m; ++i)
    {
        scanf ("%d%d",&x,&y);
		add (x,y);
    }
    bf (s);
	for (i=1; i<=n; ++i)
		if (cost[i])
			printf ("%d ",cost[i]);
		else if (i==s)
			printf ("0 ");
		else
			printf ("-1 ");
    return 0;
}