Cod sursa(job #1791181)

Utilizator medicinedoctoralexandru medicinedoctor Data 29 octombrie 2016 10:27:48
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <fstream>
#include <vector>
#include <iterator>
#include <algorithm>

using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");

vector <vector <int> > a;
vector <int> d;
int n,s;

void read()
{
    int m,x,y;
    cin >> n >> m >> s;
    a.resize(n+1);
    d.resize(n+1);
    fill(d.begin(),d.end(),-1);
    for ( ; m ; m--)
    {
        cin >> x >> y;
        if (x!=y) a[x].push_back(y);
    }
    d[s]=0;
}

void solve(int);

void assignment(int x, int y)
{
    if (y<d[x] || d[x]==-1)
    {
        d[x]=y;
        solve(x);
    }
}

void solve(int x)
{
    for (int i=0; i<a[x].size(); i++)
    {
        assignment(a[x][i],d[x]+1);
    }
}

main()
{
    read();
    solve(s);
    copy(d.begin()+1,d.end(),ostream_iterator <int> (cout, " "));
}