Cod sursa(job #1447352)

Utilizator SmitOanea Smit Andrei Smit Data 4 iunie 2015 09:19:14
Problema BFS - Parcurgere in latime Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <fstream>
#include <vector>

using namespace std;

int n,m,s,sol[100003];
vector<int> a[100003];

inline void Citire()
{
    int i,x,y,j;
    ifstream fin("bfs.in");
    fin>>n>>m>>s;
    for(i=1;i<=m;++i)
    {
        fin>>x>>y;
        if(x!=y)
            a[x].push_back(y);
    }
}

inline void Cauta(int k,int v)
{
    int i;
    sol[k]=v;
    for(i=0;i<a[k].size();++i)
        if(sol[a[k][i]]==0)
            Cauta(a[k][i],v+1);
}

int main()
{
    int i;
    Citire();
    Cauta(s,1);
    ofstream fout("bfs.out");
    for(i=1;i<=n;++i)
        fout<<sol[i]-1<<" ";
    fout<<"\n";
    fout.close();
    return 0;
}