Cod sursa(job #2487807)

Utilizator hunting_dogIrimia Alex hunting_dog Data 5 noiembrie 2019 19:00:37
Problema BFS - Parcurgere in latime Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.78 kb
#include <iostream>
#include <fstream>
#include <vector>

#define NMAX 100000

using namespace std;

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

vector <int> v[NMAX],viz,res;
int n,m,s;

void bfs(int k,int nr)
{
    vector <int> t;
    for(auto x:v[k])
        if(!viz[x])
        {
            t.push_back(x);
            viz[x]=1;
            res[x]=nr;
        }
    ++nr;
    for(auto x:t)
        bfs(x,nr);
}

int main()
{
    f>>n>>m>>s;
    for(int i=0;i<n;++i)
    {
        viz.push_back(0);
        res.push_back(-1);
    }
    for(int i=0;i<m;++i)
    {
        int x,y;
        f>>x>>y;
        v[x-1].push_back(y-1);
    }
    --s;
    res[s]=0;
    viz[s]=1;
    bfs(s,1);
    for(auto x:res)
        g<<x<<' ';
    return 0;
}