Pagini recente » Statistici Anghel Ionela Carmen (CarmenRo33) | Cod sursa (job #1504386) | Monitorul de evaluare | Istoria paginii utilizator/raluca_panainte | Cod sursa (job #2053746)
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <cstring>
#include <fstream>
using namespace std;
constexpr int kMaxN = 100000, kMaxM = 1000000;
constexpr int NIL = -1;
int head[kMaxN], to[kMaxM], vertex[kMaxM];
int bfq[kMaxN], dist[kMaxN];
void Link(int x, int y, int id) {
to[id] = head[x];
vertex[id] = y;
head[x] = id;
}
int main() {
#ifdef INFOARENA
ifstream cin("bfs.in");
ofstream cout("bfs.out");
#endif
int n, m, s; cin >> n >> m >> s; s -= 1;
memset(head, NIL, 4 * n);
for (int i = 0; i < m; i += 1) {
int x, y; cin >> x >> y; x -= 1; y -= 1;
Link(x, y, i);
}
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 (int i = head[node]; i != NIL; i = to[i]) {
const int son = vertex[i];
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];
}
}