Cod sursa(job #855909)

Utilizator enedumitruene dumitru enedumitru Data 15 ianuarie 2013 19:56:07
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in"); ofstream g("bfs.out");
const int Nmax=100009;
int n, m, s, viz[Nmax], Q[Nmax];
vector <int> L[Nmax];
int main()
{   f>>n>>m>>s;
    for(int a, b, i=1; i<=m; ++i)
        f>>a>>b, L[a].push_back(b);
    Q[1]=s; viz[s]=1;
    int p=1, u=1;
    while(p<=u)
    {   int i=Q[p++];
        int sf=L[i].size();
        for(int j=0; j<sf; ++j)
            if( !viz[L[i][j]] )
            {   viz[L[i][j]]=viz[i]+1;
                Q[++u]=L[i][j];
            }
    }
    for (int i=1;i<=n;i++) g<<viz[i]-1<<' ';
    g.close(); return 0;
}