Cod sursa(job #2809474)

Utilizator Casian_doispeChiriac Casian Casian_doispe Data 27 noiembrie 2021 09:22:15
Problema BFS - Parcurgere in latime Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.67 kb
#include <fstream>
#include <vector>
#include <algorithm>
#include <climits>

#define MOD 4001

using namespace std;

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

vector<int> m[100009] ;

int d[100009] ;

void fil(int nod, int len)
{
    if(d[nod])return ;

    d[nod] = len ;

    for(int f = 0 ; f < m[nod].size() ; f ++)
        fil(m[nod][f], len + 1) ;
}

int main()
{
    int n, q, s ;

    cin >> n >> q >> s ;

    while(q --)
    {
        int a, b ;

        cin >> a >> b ;

        m[a].push_back(b) ;
    }

    fil(s, 1) ;


    for(int f = 1 ; f <= n ; f ++)
        cout << d[f] - 1 << " " ;

    return 0 ;
}