Cod sursa(job #1852461)

Utilizator eduardturtoiEduard Turtoi eduardturtoi Data 20 ianuarie 2017 20:18:44
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <fstream>
#include <vector>
#define nmax 10010
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int> a[nmax];
int d[nmax],n,start;
int coada[nmax];

void citire()
{
    int m,x,y,i;
    fin>>n>>m>>start;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        a[x].push_back(y);
    }
}

void BFS()
{
    int st,dr,i,j;
    st=dr=1;
    coada[dr]=start;
    d[start]=1;
    while(st<=dr)
    {
        i=coada[st];
        for(j=0;j<a[i].size();j++)
            if(!d[a[i][j]])
            {
                d[a[i][j]]=d[i]+1;
                coada[++dr]=a[i][j];
            }
        st++;
    }
}

void afis()
{
    int i;
    for(i=1;i<=n;i++)
        if(!d[i] && i!=start)
            fout<<-1<<" ";
        else
            fout<<d[i]-1<<" ";
}

int main()
{
    citire();
    BFS();
    afis();
    return 0;
}