Cod sursa(job #3192465)

Utilizator laurentiu.maticaMatica Laurentiu-Andrei laurentiu.matica Data 12 ianuarie 2024 17:49:02
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.75 kb
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
int n,m,s;
vector<int>g[100005];
vector<int>dist(100005);
queue<int>q;
void citire()
{
    cin >> n >> m >> s;
    for(int i=0;i<m;i++)
    {
        int x,y;
        cin >> x >> y;
        g[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        dist[i]=-1;
}
void bfs(int st)
{
    q.push(st);
    dist[st]=0;
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(auto i:g[x])
            if(dist[i]==-1)
            {
                q.push(i);
                dist[i]=dist[x]+1;
            }
    }
}
int main()
{
    citire();
    bfs(s);
    for(int i=1;i<=n;i++)
        cout << dist[i]<< ' ';
    return 0;
}