Cod sursa(job #2759587)

Utilizator Teodora1314Teodora Oancea-Negoita Teodora1314 Data 19 iunie 2021 07:38:51
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.92 kb
//#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

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

int sol[100010],par[100010],verif[100010],i,j,n,m,s,x,y,st,dr;
vector <int> a[100010];


int main()
{
    cin>>n>>m>>s;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y;
        a[x].push_back(y);
    }
    for(i=1; i<=n; i++)
        sol[i]=-1;
    sol[s]=0;
    par[1]=s;
    st=1;
    dr=1;
    while(st<=dr)
    {
        //for(i=0;i<n;i++)
        //cout<<par[i]<<' ';

        for(j=0; j<a[par[st]].size(); j++)
        {
            if(sol[a[par[st]][j]]==-1)
            {
                dr=dr+1;
                par[dr]=a[par[st]][j];
                sol[a[par[st]][j]]=sol[par[st]]+1;
            }
        }
        // verif[st]=1;
        st++;
    }
    // cout<<"*";
    for(i=1; i<=n; i++)
    {
        cout<<sol[i]<<' ';
    }
    return 0;
}