Cod sursa(job #2867668)

Utilizator RaresCelescuRares Celescu RaresCelescu Data 10 martie 2022 14:51:39
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.77 kb
#include <vector>
#include <fstream>
#include <queue>

using namespace std;

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

const int O=100001;

vector<int> a[O];

bool d[O];

int N,M,S;

int main()
{
    cin>>N>>M>>S;
    for(int i=0;i<M;i++)
    {
        int x,y;
        cin>>x>>y;
        a[x].push_back(y);
    }
    for(int i=1;i<=N;i++)
    {
        d[i]=-1;
    }
    queue<int> q;
    q.push(S);
    d[S]=0;
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(auto y:a[x])
        {
            if(d[y]==-1)
            {
                q.push(y);
                d[y]=1+d[x];
            }
        }
    }
    for(int i=1;i<=N;i++)
    {
        cout<<d[i]<<" ";
    }
    return 0;
}