Cod sursa(job #3218290)

Utilizator Darius1414Dobre Darius Adrian Darius1414 Data 26 martie 2024 18:57:30
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.76 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
#define nmx 100005
using namespace std;
int n,m,a,b,s,vf[nmx];
vector <int> v[nmx];
void bfs(int source)
{
    vf[source]=1;
    deque <int> dq;
    dq.push_back(source);
    while (!dq.empty())
    {
        auto u=dq.front();
        dq.pop_front();
        for (auto it : v[u])
        {
            if (vf[it]==0)
            {
                vf[it]=vf[u]+1;
                dq.push_back(it);
            }
        }
    }
}
int main()
{
    ifstream f ("bfs.in");
    ofstream g ("bfs.out");
    f>>n>>m>>s;
    for (int i=1; i<=m; i++)
    {
        f>>a>>b;
        v[a].push_back(b);
    }
    bfs(s);
    for (int i=1; i<=n; i++)
        g<<vf[i]-1<<' ';
}