Cod sursa(job #2150122)

Utilizator MicuMicuda Andrei Micu Data 3 martie 2018 11:49:16
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;

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

const int N=100001;
int n,m,s,i,c[N],st=1,dr=1,d[N];
vector <int> a[N];

int main()
{
    int x,y;
    in >> n >> m >> s;
    for(i=1;i<=m;i++)
    {
        in >> x >> y;
        a[x].push_back(y);
    }

    for(i=1;i<=n;i++) d[i]=-1;

    c[1]=s;
    d[s]=0;

    while(st<=dr)
    {
        x=c[st++];
        for(unsigned j=0;j<a[x].size();j++)
        {
            y=a[x][j];
            if(d[y]==-1)
               {
                   c[++dr]=y;
                   d[y]=d[x]+1;
               }
        }
    }

    for(i=1;i<=n;i++) cout << d[i] << ' ';

    return 0;
}