Cod sursa(job #2226827)

Utilizator alexandru2001alexandru alexandru2001 Data 30 iulie 2018 18:28:52
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <iostream>
#include <bits/stdc++.h>



using namespace std;
int n;
int m;
int s;
vector <int> l[1000005];
int suka[1000005];

void nibab(int rudi[1000059])
{
    for (int i=0; i<1000059; i++){
        rudi[i]=-1;
    }
}

int smek(int j, int t)
{suka[j]=t


;    for(int k=0; k<l[j].size(); k++){
        if(suka[l[j][k]]==-1) {smek(l[j][k], t+1);}
    }
}



int main()
{ifstream f("bfs.in");
ofstream g("bfs.out");
f>>n>>m>>s;
s--;
for(int i=0; i<m; i++)
{
    int u,v;
    f>>u>>v;
    u--;
    v--;
    l[u].push_back(v);

} nibab(suka);
    smek(s,0);
    for(int j=0;j<n;j++){
       g<<suka[j]<<' ';
    }


}