Cod sursa(job #957967)

Utilizator rzvrzvNicolescu Razvan rzvrzv Data 6 iunie 2013 17:45:00
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include<cstdio>
#include<vector>

using namespace std;

vector<int> a[100002];
int i,n,m,s,x,y,p,u,nod,v[1000004],lg[100004];
bool sel[100004];

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

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].push_back(y);
    }
    bf(s);
}