Pagini recente » Borderou de evaluare (job #2091611) | Cod sursa (job #451583) | Cod sursa (job #3170934) | Borderou de evaluare (job #903062) | Cod sursa (job #2672109)
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int> graph[100002];
vector<bool> visited;
vector<int> distances;
queue<int> q;
void bfs(int start) {
q.push(start);
visited[start] = true;
while(!q.empty()) {
int head = q.front();
for(auto nb : graph[head]) {
if(visited[nb]) {
continue;
}
distances[nb] = distances[head] + 1;
q.push(nb);
visited[nb] = true;
}
q.pop();
}
}
int main() {
int n, m, s;
fin >> n >> m >> s;
visited.resize(n + 1);
distances.resize(n + 1);
for(int i = 0; i <= m; i++) {
int x, y;
fin >> x >> y;
graph[x].push_back(y);
}
bfs(s);
for(int i = 1; i < distances.size(); i++) {
if (distances[i] == 0 && i != s){
fout << -1 << ' ';
continue;
}
fout << distances[i] << ' ';
}
}