Pagini recente » Cod sursa (job #2788658) | Cod sursa (job #825673) | Cod sursa (job #1801982) | Statistici Cerc Vianu (cercVianu) | Cod sursa (job #2053748)
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <cstring>
#include <fstream>
#include <vector>
using namespace std;
constexpr int kMaxN = 100000;
vector<int> graph[kMaxN];
int dist[kMaxN], bfq[kMaxN];
int main() {
#ifdef INFOARENA
ifstream cin("bfs.in");
ofstream cout("bfs.out");
#endif
int n, m, s; cin >> n >> m >> s; s -= 1;
for (int i = 0; i < m; i += 1) {
int x, y; cin >> x >> y; x -= 1; y -= 1;
graph[x].push_back(y);
}
int q_start = 0, q_end = 1;
dist[s] = 1;
bfq[0] = s;
while (q_start != q_end) {
const int node = bfq[q_start++];
for (auto&& son : graph[node]) {
if (dist[son] == 0) {
dist[son] = dist[node] + 1;
bfq[q_end++] = son;
}
}
}
for (int i = 0; i < n; i += 1) {
cout << dist[i] - 1 << " \n"[i == n - 1];
}
}