Cod sursa(job #1473617)

Utilizator SmitOanea Smit Andrei Smit Data 19 august 2015 19:43:23
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <vector>
#include <fstream>

using namespace std;

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

inline void Citire()
{
    int i,x,y;
    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);
    }
    fin.close();
}

inline void Afisare()
{
    int i;
    ofstream fout("bfs.out");
    for(i=1;i<=n;++i)
        fout<<sol[i]<<" ";
    fout<<"\n";
    fout.close();
}

inline void BFS(int x)
{
    int j;
    for(j=0;j<a[x].size();++j)
        if(sol[a[x][j]]==-1 || sol[a[x][j]]>sol[x]+1)
        {
            sol[a[x][j]]=sol[x]+1;
            BFS(a[x][j]);
        }
}

int main()
{
    int i;
    Citire();
    for(i=1;i<=n;++i)
        sol[i]=-1;
    sol[s]=0;
    BFS(s);
    Afisare();
    return 0;
}