Pagini recente » Cod sursa (job #2113443) | Cod sursa (job #43584) | Cod sursa (job #1493852) | Cod sursa (job #2237488) | Cod sursa (job #2226535)
#include <bits/stdc++.h>
int muchii[1000010];
int degree[100010];
char level[100010];
int Q[100010], qs, qe;
inline int get_int()
{
int nr = 0, c = getchar();
for(; c < 48 | c > 57; c = getchar());
for(; c > 47 & c < 58; nr = nr * 10 + c - 48, c = getchar());
return nr;
}
void BFS(int s)
{
memset(level, 0xFF, sizeof level);
qs = qe = 0;
level[s] = 0;
Q[qe++] = s;
while(qs < qe)
{
int t = Q[qs++];
for(int it = degree[t], tar = degree[t + 1]; it != tar; ++it)
{
int v = muchii[it];
if(level[v] >= 0) continue;
level[v] = level[t] + 1;
Q[qe++] = v;
}
}
}
char buffer[20000000]; int p = -1;
__attribute__((always_inline)) void put_int(int x)
{
if(x == -1)
{
buffer[++p] = 45; buffer[++p] = 49; buffer[++p] = 32;
return;
}
int digits = x > 0x270F ? 0x6 :
x > 0x3E7 ? 0x5 :
x > 0x63 ? 0x4 :
x > 0x9 ? 0x3 : 0x2;
for(int i = digits; --i; x /= 10)
{
buffer[p + i] = x % 10 + 48;
}
buffer[p = p + digits] = 32;
}
int main()
{
freopen("bfs.in", "r", stdin);
freopen("bfs.out", "w", stdout);
int N, M, start, u, v;
N = get_int();
M = get_int();
start = get_int();
for(int i = 0; i < M; ++i)
{
u = get_int();
v = get_int();
++degree[u];
}
for(int i = 1; i <= N; ++i)
{
degree[i] += degree[i - 1];
}
degree[N + 1] = M;
freopen("bfs.in", "r", stdin);
N = get_int();
M = get_int();
start = get_int();
for(int i = 0; i < M; ++i)
{
u = get_int();
v = get_int();
muchii[--degree[u]] = v;
}
BFS(start);
for(int i = 1; i <= N; ++i)
{
put_int(level[i]);
}
fwrite(buffer, 1, p, stdout);
return 0;
}