Cod sursa(job #957948)

Utilizator rzvrzvNicolescu Razvan rzvrzv Data 6 iunie 2013 17:23:23
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include<cstdio>

using namespace std;

int lg[1004],s,v[1004],i,n,m,x,y,t;
bool sel[1004],a[4004][4004];

int bf(int x)
{
    int u,p,i,nod;
    for(i=1;i<=n;i++)
    {
        lg[i]=-1;
    }
    lg[x]=0;sel[x]=true;
    p=1;u=1;v[1]=x;
    while(p<=u)
    {
        nod=v[p];
        for(i=1;i<=n;i++)
        {
            if(a[nod][i]&&!sel[i])
            {
                v[++u]=i;
                sel[i]=true;
                lg[i]=lg[nod]+1;
            }
        }
        p++;
    }
    for(i=1;i<=n;i++)
    {
        printf("%d ",lg[i]);
    }
}

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",&x,&y);
        a[x][y]=true;
    }
    bf(s);
}