Cod sursa(job #1846084)

Utilizator NaritaAndreiNarita Andrei NaritaAndrei Data 12 ianuarie 2017 09:51:47
Problema BFS - Parcurgere in latime Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,i,a[1000][1000],pi,ps,d[1000],coada[1000],s,x,y;
void citire()
{
    f>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y;
        if(x!=y)
        {a[x][y]=1;
        }
    }
}
void parcurgere()
{
    pi=1;
    ps=1;
    coada[pi]=s;
    while(ps<=pi)
    {
        for(int i=1;i<=n;i++)
        {
            if(a[coada[ps]][i]!=0 && d[i]==0)
            {
                d[i]=d[coada[ps]]+1;
                coada[++pi]=i;
            }
        }
        ps++;
    }
}
void afisare()
{
    d[s]=0;
    for(int i=1;i<=n;i++)
        if(d[i]==0 && i!=s)
        {
            g<<-1<<" ";
        }
        else g<<d[i]<<" ";
}
int main()
{
    citire();
    parcurgere();
    afisare();
    return 0;
}