Cod sursa(job #1890041)

Utilizator minut1Baies Cosmin minut1 Data 23 februarie 2017 00:18:52
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <fstream>
#include <vector>

using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");

const int N=100001;
int n,m,s,i,x,y,q[N],d[N],p,u=-1;
//int pred[N];
vector <int> a[N];

void citire()
{
    cin >> n >> m >> s;
    for(i=1; i<=m; i++){
        cin >> x >> y;
        a[x].push_back(y);
    }
}

int main()
{
    citire();
    for(i=1; i<=n; i++)
        d[i]=-1;
    q[++u]=s;
    d[s]=0;
    while(p<=u){
        x=q[p++];
        for(i=0; i<a[x].size(); i++){
            y=a[x][i];
            if(d[y]==-1){
                q[++u]=y;
                d[y]=1+d[x];
                //pred[y]=x;
            }
        }
    }
    for(i=1; i<=n; i++)
        cout << d[i] << " ";
    return 0;
}