Cod sursa(job #1224008)

Utilizator T.C.11Tolan Cristian T.C.11 Data 29 august 2014 14:16:54
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>
#include <list>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
list<int> L[100001];
int n,m,S,s[100001],cd[100001],i,z,ld,ls,val,x,y;
int main()
{
    fin>>n>>m>>S;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        L[x].push_back(y);
    }
    cd[1]=S;
    s[S]=0;
    ls=1;
    ld=1;
    while (ls<=ld)
    {
        z=cd[ls];
        ls++;
        val=s[z]+1;
        for (list<int>::iterator it = L[z].begin(); it != L[z].end(); ++it)
        {
            if (s[*it]==0)
            {
                ld++;
                cd[ld]=*it;
                s[*it]=val;
            }
        }
    }
    for (i=1;i<=n;i++)
    {
        if (i==S)
            fout<<0<<" ";
        else if (s[i]==0)
            fout<<-1<<" ";
        else
            fout<<s[i]<<" ";
    }
    return 0;
}