Cod sursa(job #1997447)

Utilizator humastefan19Huma Stefan humastefan19 Data 4 iulie 2017 13:14:21
Problema BFS - Parcurgere in latime Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <iostream>

#include<fstream>

const int N=100001;
const int M=1000001;

int nr;
int lst[N], q[N],d[N];
int vf[M], urm[M];

using namespace std;

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

int main()
{

ifstream cin("bfs.in");
ofstream cout("bfs.out");
    int n, m, s,i, x, y, p, u, poz;
    cin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        cin>>x>>y;
        adaugare(x, y);
    }
    p=-1;
    u=0;
    for(i=1;i<=m;i++)
    {
      d[i]=-1;
    }
    q[++u]=s;
    d[s]=0;
    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];
        }

    }
    for(i=1;i<=n;i++)
    {
        cout<<d[i]<<' ';
    }
    return 0;
}