Cod sursa(job #2524335)

Utilizator victor1306Victor Mihaila victor1306 Data 15 ianuarie 2020 15:03:46
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.74 kb
#include <fstream>

using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
int vf[2000002], urm[2000002], lst[100002],nr,d[100005],q[100005];
void adauga(int x, int y){

    vf[++nr]=y;

    urm[nr]=lst[x];

    lst[x]=nr;

}
int main()
{
    int n,m,x,x0,y,a,b;
    cin>>n>>m>>x0;
    for(int i=1;i<=m;i++){
        cin>>a>>b;
        adauga(a,b);
    }
    int st=0, dr=-1;
    for(int i=1;i<=n;i++){
        d[i]=-1;
    }
    d[x0]=0;
    q[++dr]=x0;
    while(st<=dr){
        x=q[st++];
        for(int p=lst[x];p!=0;p=urm[p]){
            y=vf[p];
            if(d[y]==-1){
                d[y]=1+d[x];
                q[++dr]=y;
            }
        }
    }
    for(int i=1;i<=n;i++){
        cout<<d[i]<<" ";
    }
    return 0;
}