Cod sursa(job #2783608)
Utilizator | Data | 14 octombrie 2021 19:32:46 | |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
const int N=1e5+1;
int n,m,s;
int d[N];
vector <int> a[N];
queue <int> q;
void bfs(int s) {
q.push(s);
d[s]=0;
while(!q.empty()){
int x=q.front();
q.pop();
for(int j:a[x]){
if(d[j]==-1){
d[j]=d[x]+1;
q.push(j);
}
}
}
}
int main() {
f>>n>>m>>s;
for(int i=1; i<=m; i++){
int x,y;
f>>x>>y;
a[x].push_back(y);
}
for(int i=1; i<=n; i++)
d[i]=-1;
bfs(s);
for(int i=1; i<=n; i++)
g<<d[i]<<" ";
return 0;
}