Cod sursa(job #973922)

Utilizator Darius15Darius Pop Darius15 Data 15 iulie 2013 23:32:07
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.56 kb
#include <fstream>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int m,n,s,x,y,i,d[10000],a[10000][10000],c[10000],p,u,nc;
bool v[100000];
int main()
{
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    f>>x>>y,a[x][y]=1;
    for (i=1;i<=n;i++) v[i]=false;
    c[0]=s;
    v[s]=true;
    while(p<=u)
    {
        nc=c[p++];
        for (i=1;i<=n;i++)
        if (a[nc][i]==1 && v[i]==false )
        d[i]=d[nc]+1,c[++u]=i,v[i]=true;
    }
    for (i=1;i<=n;i++) if (v[i]==true) g<<d[i]<<' ';
    else g<<"-1"<<' ';
     return 0;
}