Cod sursa(job #2791264)

Utilizator lucriLuchian Cristian lucri Data 30 octombrie 2021 12:04:40
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.76 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
int n,m,s,d[100010],x,y,c[100010];
vector<vector<int>>a;
bool v[100010];
int main()
{
    in>>n>>m>>s;
    a.resize(n+5);
    for(int i=1;i<=m;++i)
    {
        in>>x>>y;
        a[x].push_back(y);
    }
    c[1]=s;
    int ic=1,sc=1;
    v[s]=true;
    while(ic<=sc)
    {
        for(auto q:a[c[ic]])
        {
            if(v[q]==false)
            {
                v[q]=true;
                c[++sc]=q;
                d[q]=d[c[ic]]+1;
            }
        }
        ++ic;
    }
    for(int i=1;i<=n;++i)
    {
        if(d[i]==0&&i!=s)
            out<<-1<<' ';
        else
            out<<d[i]<<' ';
    }
    return 0;
}