Cod sursa(job #1418150)

Utilizator bt.panteaPantea Beniamin bt.pantea Data 12 aprilie 2015 00:04:09
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("bfs.in");
ofstream g ("bfs.out");
int c[100005],v[100005],n,m,s,a[100005][5000],inc,sf,i,x,y;
int main()
{
    f>>n>>m>>s;
    for (i=1;i<=n;i++) v[i]=-1;
    v[s]=0;
    for (i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x][0]++;
        a[x][a[x][0]]=y;
    }
    c[0]=s;
    while (inc<=sf)
    {
        x=c[inc];
        inc++;
        for (i=1;i<=a[x][0];i++)
        {
            if (v[a[x][i]]==-1)
            {
                v[a[x][i]]=v[x]+1;
                c[++sf]=a[x][i];
            }
        }
    }
    for (i=1;i<=n;i++)
        g<<v[i]<<' ';
    return 0;
}