Cod sursa(job #622011)

Utilizator nbibestNeagu Bogdan Ioan nbibest Data 17 octombrie 2011 09:45:29
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.98 kb
#include <iostream>
#include <stdio.h>
#include <vector>

using namespace std;

int nn,n,s,x,y,v[100100],i,j,k,a,b,u,p,c[100100];
vector<int> m[100100];
vector<int>::iterator it;
int d[1000100];

int main()
{

    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);

    scanf("%d %d %d",&n,&nn,&s);

    for (i=1;i<=nn;i++)
    {
        scanf("%d %d",&x,&y);
        //c[x]++;
        //m[(x-1)*100+c[x]]=y;
        m[x].push_back(y);
    }

    for (i=1;i<=n;i++)
    v[i]=-1;

    v[s]=0;

    p=0;u=1;d[1]=s;
    while (p<=u)
    {
        d[p]=0;
        p++;

        //for (i=1;i<=m[x].size();i++)
        for (it=m[d[p]].begin(); it<m[d[p]].end(); it++)
        {
            //printf("%d \n",*it);
            if (v[*it]==-1)
            {
                u++;
                d[u]=*it;
                v[*it]=v[d[p]]+1;
            }
        }

    }


    for (i=1;i<=n;i++)
    printf("%d ",v[i]);


    return 0;
}