Cod sursa(job #3216139)

Utilizator LucaT2Tasadan Luca LucaT2 Data 15 martie 2024 17:44:23
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.81 kb
#include<bits/stdc++.h>

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector<int> v[1001];

int n,m,s;

void citire()
{
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
    }

}

int viz[1001],d[1001];

void bfs()
{
    viz[s]=1;
    d[s]=0;
    queue<int> q;
    q.push(s);
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(auto i:v[x])
        {
            if(!viz[i])
            {
                q.push(i);
                viz[i]=1;
                d[i]=d[x]+1;
            }
        }
    }
    for(int i=1;i<=n;i++)
        if(viz[i])
            fout<<d[i]<<" ";
        else fout<<"-1 ";
}
int main()
{
    citire();
    bfs();
    return 0;
}