Cod sursa(job #1411224)

Utilizator mmc170597Marin Mihnea Cristian mmc170597 Data 31 martie 2015 15:50:40
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.02 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream in("bfs.in");
ofstream out ("bfs.out");
int n,m,s,v[100001],viz[100001],coada[100001],limsup,liminf=1;
vector<int> vi;
vector<vector<int> > a;
void citire(){
    in>>n>>m>>s;
    for(int i=0;i<=n;i++)
        a.push_back(vi);
    int x,y;
    for(int i=1;i<=m;i++){
        in>>x>>y;
        if(y!=x)
            a[x].push_back(y);
    }
}
void pune(int x){
    coada[++limsup]=x;
}
void extrage(int &x){
    x=coada[liminf];
    liminf++;
}
void bfs(int nod){
    pune(nod);
    viz[nod]=1;
    while(liminf<=limsup){
        int x;
        extrage(x);
        for(int i=0;i<a[x].size();i++)
            if(viz[a[x][i]]==0){
                pune(a[x][i]);
                viz[a[x][i]]=1;
                v[a[x][i]]=v[x]+1;
        }
    }
}
int main()
{
    citire();
    bfs(s);
    for(int i=1;i<=n;i++)
        if(v[i]==0)
        v[i]=-1;
    v[s]=0;
    for(int i=1;i<=n;i++)
        out<<v[i]<<" ";
    return 0;
}