Cod sursa(job #3375489)

Utilizator mgorganGorgan Maria mgorgan Data 12 noiembrie 2026 09:31:30
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

vector <vector<int> > graf;
vector <int> d;

void bfs(int nod)
{
    queue<int> q;
    q.push(nod);
    d[nod]=1;
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for(int j=0;j<graf[nod].size();j++)
        {
            int next=graf[nod][j];
            if(d[next]==0)
            {
                d[next]=d[nod]+1;
                q.push(next);
            }
        }
    }
}
int main()
{
    int n,m,s,i,a,b;
    cin>>n>>m>>s;
    d.resize(n+1);
    graf.resize(n+1);
    for(i=1;i<=m;i++)
    {
        cin>>a>>b;
        graf[a].push_back(b);
    }
    bfs(s);
    for(i=1;i<=n;i++)
        cout<<d[i]-1<<" ";
    return 0;
}