Cod sursa(job #3005164)

Utilizator MarinescuMirceaMarinescu Mircea MarinescuMircea Data 16 martie 2023 19:53:28
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.74 kb
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
vector<int>v[100005];
int n, m, s, x, y, d[100005];
int main()
{
    cin >> n >> m >> s;
    while ( cin >> x >> y )
    {
        v[x].push_back(y);
    }
    queue<int>q;
    for ( int i = 1; i <= n; i++ )
    {
        d[i] = -1;
    }
    d[s] = 0;
    q.push(s);
    while (!q.empty())
    {
        int x = q.front();
        q.pop();
        for ( auto y:v[x] )
        {
            if ( d[y] == -1 )
            {
                d[y] = 1 + d[x];
                q.push(y);
            }
        }
    }
    for ( int i = 1; i <= n; i++ )
    {
        cout << d[i] << " ";
    }
}