Cod sursa(job #2277491)

Utilizator mirceaisherebina mircea mirceaishere Data 6 noiembrie 2018 13:06:08
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

int n, m, i, j, v[100010], c[100010], start, x, y, u, p, nod1, nod2, cost[100010];
vector<int>a[100010];

int main(){
    fin>>n>>m>>start;
    for(i=1; i<=m; i++){
        fin>>x>>y;
        a[x].push_back(y);
    }
    u=1;
    p=1;
    c[1]=start;
    v[start]=1;
    while(p<=u){
        nod1=c[p];
        for(i=0; i<a[nod1].size(); i++){
            nod2=a[nod1][i];
            if(v[nod2]==0){
                v[nod2]=1;
                cost[nod2]=cost[nod1]+1;
                u++;
                c[u]=nod2;
            }
        }
        p++;
    }
    for(i=1; i<=n; i++){
        if(cost[i]==0 && i!=start)
            fout<<-1<<" ";
        else
            fout<<cost[i]<<" ";
    }
}