Cod sursa(job #2709273)

Utilizator enedumitruene dumitru enedumitru Data 20 februarie 2021 09:32:18
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.53 kb
#include <bits/stdc++.h>
#define Nmax 100009
using namespace std;
ifstream f("bfs.in"); ofstream g("bfs.out");
int n,m,s,viz[Nmax],Q[Nmax];
vector <int> L[Nmax];
int main()
{   f>>n>>m>>s;
    for(int a,b;m;--m) f>>a>>b, L[a].push_back(b);
    Q[1]=s; viz[s]=1;
    int p=1,u=1;
    while(p<=u)
    {   int i=Q[p++],sf=L[i].size();
        for(int j=0;j<sf;++j)
            if(!viz[L[i][j]])
                {viz[L[i][j]]=viz[i]+1; Q[++u]=L[i][j];}
    }
    for(int i=1;i<=n;i++) g<<viz[i]-1<<' ';
    g.close(); return 0;
}