Cod sursa(job #2257153)

Utilizator serban24Popovici Serban-Florin serban24 Data 9 octombrie 2018 18:49:32
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <bits/stdc++.h>
#define NMAX 255

using namespace std;

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

int m,n;
vector <int> mv[100005];
queue <int> q;
int viz[100005];
int v[100005];

void BFS(int val){
    int i;

    viz[val]=1;
    q.push(val);

    while(!q.empty()){
        val=q.front();
        q.pop();

        for(i=0;i<mv[val].size();i++){
            if(!viz[mv[val][i]]){
                viz[mv[val][i]]=1;
                v[mv[val][i]]=v[val]+1;
                q.push(mv[val][i]);
            }
        }
    }
}

int main(){
    int i,j,x,y,s;

    fin>>n>>m>>s;

    for(i=1;i<=m;i++){
        fin>>x>>y;
        mv[x].push_back(y);
    }

    BFS(s);

    for(i=1;i<=n;i++)
        if(viz[i])
            fout<<v[i]<<" ";
        else fout<<-1<<" ";

    return 0;
}