Cod sursa(job #1310179)

Utilizator stefanlaculeanuLaculeanu Stefan stefanlaculeanu Data 6 ianuarie 2015 15:55:09
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <iostream>
#include <fstream>
using namespace std;

ifstream in("bfs.in");
ofstream out("bfs.out");

int n , m , s, lst[100001],vf[1000001],urm[1000001],nr,INF,p=1,u,st,dr,d[1000001],q[1000001];

void adauga( int x , int y )
{
    vf[++nr]=y;
    urm[nr]=lst[x];
    lst[x]=nr;
}

void bfs(int x)
{
    int y,poz;
    for( int i =1 ; i <= n ; i++ )
        d[i]=-1;
    d[x]=0;
    q[++u]=x;
    while(p<=u)
    {
        x=q[p++];
        poz=lst[x];
        while(poz!=0)
        {
            y=vf[poz];
            if(d[y]==-1)
            {
                d[y]=1+d[x];
                q[++u]=y;
            }
            poz=urm[poz];
        }
    }
}

int main()
{
    int x , y;
    in>>n;
    in>>m;
    in>>s;
    for (int i = 1; i <= m; i++)
    {
        in>>x>>y;
        adauga(x,y);
    }
    bfs (s);
    for(int i=1;i<=n;i++)
    {
        out<<d[i]<<" ";
    }
    return 0;
}