Pagini recente » Cod sursa (job #2075455) | Cod sursa (job #1512454) | Cod sursa (job #536672) | Cod sursa (job #30274) | Cod sursa (job #2226500)
#include <bits/stdc++.h>
/*
#define BUFFER_SIZE 12500000
char buffer[BUFFER_SIZE], *head = buffer, *writeHead = buffer;
bool isDigit[255];
void parseInit()
{
buffer[fread(buffer, 1, BUFFER_SIZE, stdin)] = 0;
for(int i = 47; i < 58; ++i) isDigit[i] = 1;
}
*/
const int MAXBUF = 20000000;
char buffer[MAXBUF];
char *head;
int isDigit[255];
char *writeHead;
void parseInit()
{
int a = fread(buffer, 1, MAXBUF, stdin);
buffer[a] = 0;
head = buffer;
memset(isDigit, 0, sizeof isDigit);
for(int i = 47; i < 58; ++i) isDigit[i] = 1;
writeHead = head;
}
__attribute__((always_inline)) int get_int2()
{
int number = 0;
for(; !isDigit[*head]; ++head);
for(; isDigit[*head]; ++head)
number = number * 10 + (*head) - 48;
return number;
}
__attribute__((always_inline)) unsigned int get_int()
{
static char inBuffer[0x20000];
static unsigned int p = 0x1FFFF; unsigned int number = 0x0;
while(inBuffer[p] < 0x30 || inBuffer[p] > 0x39)
{
++p == 0x20000 && (fread(inBuffer, 0x1, 0x20000, stdin), p = 0x0);
}
for(;;)
{
number = number * 0xA + inBuffer[p] - 0x30;
++p == 0x20000 && (fread(inBuffer, 0x1, 0x20000, stdin), p = 0x0);
if(inBuffer[p] < 0x30 || inBuffer[p] > 0x39) break;
}
return number;
}
int muchii[1000010];
int degree[100010];
char level[100010];
void BFS(int s)
{
int Q[100010], qs = 0, qe = 0;
memset(level, 0xFF, sizeof level);
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;
}
}
}
int main()
{
freopen("bfs.in", "r", stdin);
freopen("bfs.out", "w", stdout);
///parseInit();
int N = get_int(), M = get_int(), start = get_int();
for(int i = 0; i < M; ++i)
{
++degree[get_int()];
get_int();
}
for(int i = 1; i <= N; ++i)
{
degree[i] += degree[i - 1];
}
degree[N + 1] = M;
head = buffer;
get_int(), get_int(), get_int();
for(int i = 0; i < M; ++i)
{
int u = get_int(), v = get_int();
muchii[--degree[u]] = v;
}
BFS(start);
for(int i = 1; i <= N; ++i)
{
printf("%d ", level[i]);
}
///fwrite(buffer, 1, writeHead - buffer, stdout);
return 0;
}