Nu aveti permisiuni pentru a descarca fisierul grader_test13.ok
Cod sursa(job #3005200)
Utilizator | Data | 16 martie 2023 20:08:53 | |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
const int N=100000 + 2;
int n, m, s, v[N];
vector <int> vec[N];
void bfs(int nd, int cnt){
v[nd] = cnt;
for(auto i: vec[nd] ){
if(v[i] == 0){
v[i] = cnt;
bfs(i, cnt+1);
}
}
}
int main()
{
in >> n >> m >> s;
for(int i=1; i<=m; i++){
int x, y;
in >> x >> y;
vec[x].push_back(y);
}
bfs(s, 1);
for(int i=1; i<=n; i++){
out<< v[i] - 1 << " ";
}
return 0;
}