Cod sursa(job #1848734)

Utilizator NaritaAndreiNarita Andrei NaritaAndrei Data 16 ianuarie 2017 16:15:27
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.99 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int t[2][1000001],d[100001],start[100001],k,i,ps,pi,m,n,s,coada[100001];
void citire()
{
    int x,y;
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        if(x!=y)
        {
            k++;
            t[0][k]=y;
            t[1][k]=start[x];
            start[x]=k;
        }
    }
}
void bfs()
{
    pi=1;ps=1;
    coada[ps]=s;
    while(pi>=ps)
    {
        int x=start[coada[ps]];
        while(x!=0)
        {
            if(d[t[0][x]]==0)
            {
                d[t[0][x]]=d[coada[ps]]+1;
                pi++;
                coada[pi]=t[0][x];
            }
            x=t[1][x];
        }
        ps++;

    }

}
void afisare()
{
    d[s]=0;
    for(i=1;i<=n;i++)
    {
        if(i!=s&& d[i]==0) g<<-1<<" ";
        else g<<d[i]<<" ";
    }
}
int main()
{
    citire();
    bfs();
    afisare();
    return 0;
}