Cod sursa(job #2130207)

Utilizator sabinantonSabin Anton sabinanton Data 13 februarie 2018 15:33:47
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <bits/stdc++.h>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int N=10000001;
vector <int> a[N];
int n,m,v[N],d[N],st=-1,dr,k;
int main()
{
    int x,y,i,j;
    fin>>n>>m>>k;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        a[x].push_back(y);
    }
    for(i=0;i<=n;i++)
    {
        d[i]=-1;
    }
    v[++dr]=k;
    d[k]=0;
    while(st<=dr)
    {
        x=v[st++];
        for(i=0;i<a[x].size();i++)
        {
            y=a[x][i];
            if(d[y]==-1)
            {
                v[++dr]=y;
                d[y]=1+d[x];
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        fout<<d[i]<<" ";
    }
    return 0;
}