Cod sursa(job #3005174)

Utilizator MarinescuRaduMarinescu Radu MarinescuRadu Data 16 martie 2023 19:59:22
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.7 kb
#include<fstream>
#include<queue>
#include<vector>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
int n,m,s,x,y,d[100001];
vector<int>a[100001];
int main()
{
    cin>>n>>m>>s;
   while ( cin >> x >> y )
    {
        a[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:a[x])
        {
            if(d[y]==-1)
            {
                d[y]=1+d[x];
                q.push(y);
            }
        }
    }
        for ( int i = 1; i <= n; i++ )
    {
        cout << d[i] << " ";
    }

}