Cod sursa(job #2808020)

Utilizator CleliaClelia Maria Dobrescu Clelia Data 24 noiembrie 2021 14:35:19
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.71 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
vector <int> lista[100001];
int q[100001],v[100001];
int main ()
{
    int n,m,s,i,x,y,st,dr,nod;
    fin>>n>>m>>s;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y;
        lista[x].push_back(y);
    }
    q[1]=s;
    st=dr=1;
    v[s]=1;
    while (st<=dr)
    {
        nod=q[st];
        for (i=0;i<lista[nod].size();i++)
            if (v[lista[nod][i]]==0)
            {
                dr++;
                q[dr]=lista[nod][i];
                v[lista[nod][i]]=v[nod]+1;
            }
        st++;
    }
    for (i=1;i<=n;i++)
        fout<<v[i]-1<<" ";
    return 0;
}