Cod sursa(job #301629)

Utilizator mihai0110Bivol Mihai mihai0110 Data 8 aprilie 2009 12:28:30
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include<cstdio>
#include<vector>
#define MAXN 100001

using namespace std;

int n,m,S,x,y;
vector <int> a[MAXN];
int v[MAXN],q[MAXN],d[MAXN];


void bf()
{
    int p,u,X,Y,i;
    memset(d,-1,sizeof(d));
    p=u=1;
    q[p]=S;
    v[S]=1;
    d[S]=0;
    for(;p<=u;p++)
    {
        X=q[p];
        for(i=0;i<a[X].size();i++)
        {
            Y=a[X][i];
            if(!v[Y])
            {
                v[Y]=1;
                d[Y]=d[X]+1;
                q[++u]=Y;
            }
        }
    }
    for(i=1;i<=n;i++)
        printf("%d ",d[i]);
}

int main(void)
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d%d%d",&n,&m,&S);
    while(m--)
    {
        scanf("%d%d",&x,&y);
        a[x].push_back(y);
    }
    bf();
    return 0;
}