Cod sursa(job #2665440)
| Utilizator | Data | 30 octombrie 2020 19:37:26 | |
|---|---|---|---|
| Problema | BFS - Parcurgere in latime | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <vector>
using namespace std;
vector<int> g[100001];
int n, m, s, d[100001];
void bfs(int n) {
for(auto i:g[n])
if(d[i]==-1) {
d[i]=d[n]+1;
bfs(i);
}
}
int main() {
ifstream in("bfs.in");
ofstream out("bfs.out");
in>>n>>m>>s;
for(int i=0; i<m; i++) {
int x, y;
in>>x>>y;
g[x].push_back(y);
}
for(int i=1; i<=n; i++)
d[i]=-1;
d[s]=0;
bfs(s);
for(int i=1; i<=n; i++)
out<<d[i]<<" ";
return 0;
}
