Pagini recente » Istoria paginii runda/simulare_oji_2024_clasele_11_12_16_februarie | Cod sursa (job #1511316) | Cod sursa (job #1031030) | Cod sursa (job #944686) | Cod sursa (job #605399)
Cod sursa(job #605399)
# include <cstdio>
# include <cstring>
# include <vector>
using namespace std;
const char *FIN = "bfs.in", *FOU = "bfs.out";
const int MAX = 100005;
vector <int> G[MAX];
int N, M, S, dp[MAX];
void bfs (int S) {
memset (dp, -1, sizeof (dp)), dp[S] = 0;
int Q[MAX], st = 0, dr = 0;
for (Q[++dr] = S; st <= dr; ++st) {
int X = Q[st];
for (vector <int> :: iterator i = G[X].begin (); i != G[X].end (); ++i)
if (dp[*i] == -1) {
Q[++dr] = *i, dp[*i] = dp[X] + 1;
}
}
}
int main (void) {
freopen (FIN, "r", stdin);
freopen (FOU, "w", stdout);
scanf ("%d %d %d", &N, &M, &S);
for (int i = 1, x, y; i <= M; ++i) {
scanf ("%d %d", &x, &y);
G[x].push_back (y);
}
bfs (S);
for (int i = 1; i <= N; ++i)
printf ("%d ", dp[i]);
}