Cod sursa(job #1127147)

Utilizator cosminonofreCosmin Onofre cosminonofre Data 27 februarie 2014 11:21:55
Problema BFS - Parcurgere in latime Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include<fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
long i,n,m,s,p,q,x,y,nr,a[1000][1000],d[1000],v[1000],viz[1000];
int main()
{
    f>>n>>m>>s;
    for (i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x][0]++;
        a[x][a[x][0]]=y;
    }
    p=1;
    v[p]=s;
    d[s]=0;
    viz[s]=1;
    q=1;
    while (p<=q && p<=n)
    {
        for (i=1;i<=a[v[p]][0];i++)
            if (viz[a[v[p]][i]]==0)
            {
                q++;
                v[q]=a[v[p]][i];
                viz[a[v[p]][i]]=1;
                d[a[v[p]][i]]=d[v[p]]+1;
            }
        p++;
    }
    for (i=1;i<=n;i++)
        if (viz[i]!=0)
            g<<d[i]<<" ";
            else
                g<<"-1 ";
    return 0;
}