Cod sursa(job #1846085)

Utilizator Mihaela_NaritaMihaela Narita Mihaela_Narita Data 12 ianuarie 2017 09:53:41
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <fstream>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int coada[100000],pi,ps,d[100000],a[10000][10000],s,n,m;
void bf()
{
    coada[1]=s;
    ps=1;
    pi=1;
    while(ps<=pi)
    {
        for(int i=1;i<=n;i++)
            if(a[coada[ps]][i]==1)
            {
                if(d[i]==0)
                    d[i]=d[coada[ps]]+1,coada[++pi]=i;
            }
        ++ps;
    }
}
int main()
{
    int x,y;
    f>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y;
        if(x!=y)
        a[x][y]=1;
    }
    bf(); d[s]=0;
    for(int i=1;i<=n;i++)
        if(d[i]==0 && s!=i)
        d[i]=-1;
    for(int i=1;i<=n;i++)
        g<<d[i]<<" ";
    return 0;
}