Cod sursa(job #3344130)

Utilizator IleaIlea Bogdan Ilea Data 1 martie 2026 13:55:27
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.8 kb
#include<iostream>
#include<vector>
#include<queue>
using namespace std;

#define NMAX 100001

int n,m,s,d[NMAX];
vector<int>g[NMAX];
signed main(){
#ifndef LOCAL
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#endif // LOCAL
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    cin>>n>>m>>s;
    fill(d,d+n+1,0xffffffff);
    for(int i=1;i<=m;++i){
        int x,y;
        cin>>x>>y;
        g[x].push_back(y);
        // g[y].push_back(x);
    }
    queue<int>q;
    q.push(s);
    d[s]=0;
    for(;!q.empty();q.pop()){
        int i=q.front();
        for(auto it:g[i]){
            if(d[it]>=0)continue;
            d[it]=d[i]+1;
            q.push(it);
        }
    }
    for(int i=1;i<=n;++i)cout<<d[i]<<" ";
    return 0;
}