Cod sursa(job #2277020)
Utilizator | Rosca Rares Raresr14 | Data | 5 noiembrie 2018 18:37:37 |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
#define DIM 100100
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s,x,y,c[DIM],f[DIM],l[DIM],p,u,i,j;
vector<int> L[DIM];
int main(){
fin>>n>>m>>s;
for(i=1;i<=m;i++){
fin>>x>>y;
L[x].push_back(y);
}
p=1; u=1; c[1]=s; f[s]=1; l[s]=1;
while(p<=u){
int nod=c[p];
for(i=0;i<L[nod].size();i++){
int vec=L[nod][i];
if(f[vec]==0){
f[vec]=1;
l[vec]=1+l[nod];
c[++u]=vec;
}
}
p++;
}
for(i=1;i<=n;i++)
fout<<l[i]-1<<" ";
return 0;
}