Cod sursa(job #2277261)

Utilizator DanutAldeaDanut Aldea DanutAldea Data 5 noiembrie 2018 22:05:02
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.61 kb
#include <fstream>
#include <vector>
using namespace std;

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

int n,m,i,j,p,u,x,f[100010],c[100010];
vector <int> l[100010];

int main(){
    fin>>n>>m>>x;
    for(;m;m--){
        fin>>i>>j;
        l[i].push_back(j);
    }

    c[++p]=x;
    u++;
    f[x]=1;

    while(p<=u){
        for(i=0;i<l[c[p]].size();i++){
            if(f[ l[c[p]][i] ]==0){
                c[++u]=l[c[p]][i];
                f[l[c[p]][i]]=f[c[p]]+1;
            }
        }

        p++;
    }

    for(i=1;i<=n;i++)
        fout<<f[i]-1<<" ";

    return 0;
}