Cod sursa(job #798447)

Utilizator IoanaMarMarussi Ioana IoanaMar Data 16 octombrie 2012 17:34:16
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

vector <int>v[10000];

int n,m,s;
int viz[100010],c[100000000], d[100010];
int main()
{
int x,y,sf,i,j;
f>>n>>m>>s;
    for ( i=1; i<=m; i++)
    {   f>>x>>y;
        v[x].push_back(y);

    }

    for ( i=1; i<=n; i++)
    {
        viz[i] = 0;
        d[i]=10000000;
    }
    viz[s]=1;
    d[s]=0;
    c[1]=s; sf = 1;
    for (j=1; j<=sf; j++)
    for (i = 0; i < v[c[j]].size(); i++)
    if (viz[v[c[j]][i]] == 0)
    {
        sf++;
        c[sf]=v[c[j]][i];
        viz[v[c[j]][i]]=1;
        d[v[c[j]][i]] = d[c[j]]+1;
    }
    for (i=1; i<=n; i++)
        if (d[i]!= 10000000)
            g<<d[i]<<" ";
        else g<<-1<<" ";

return 0;
}