Cod sursa(job #2222410)

Utilizator inquisitorAnders inquisitor Data 16 iulie 2018 22:57:37
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 2.06 kb
#include <bits/stdc++.h>
using namespace std;

#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;
}

__attribute__((always_inline)) int get_int()
{
    int number = 0;

    for(; !isDigit[*head]; ++head);

    for(;  isDigit[*head]; ++head)

        number = number * 10 + (*head) - 48;

    return number;
}

const int MAXN = 100010;
const int MAXM = 1000010;
int muchii[MAXM];
int offsetOf[MAXN];
char dst[MAXN];
int Q[MAXN], qs, qe;

void BFS(int s) {
  memset(dst, 0xFF, sizeof dst);
  qs = qe = 0;
  dst[s] = 0;
  Q[qe++] = s;
  while (qs < qe) {
     int t = Q[qs++];
    for ( int it = offsetOf[t], tar = offsetOf[t + 1]; it != tar; ++it) {
       int v = muchii[it];
      if (dst[v] >= 0)
        continue;
      dst[v] = dst[t] + 1;
      Q[qe++] = v;
    }
  }
}

__attribute__((always_inline)) void put_int(int x)
{
    if(x == 0)
    {
        *(writeHead++) = '0'; *(writeHead++) = ' ';

        return;
    }

    if(x < 0)
    {
        *(writeHead++) = 45; *(writeHead++) = 49; *(writeHead++) = 32;

        return;
    }

    char *old = writeHead;

    while(x)
    {
        *(writeHead++) = x % 10 + 48;

        x /= 10;
    }

    reverse(old, writeHead);

    *(writeHead++) = 32;
}

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);

  parseInit();
  int N = get_int(), M = get_int(), S = get_int();
  for ( int i = 0; i < M; ++i) {
    ++offsetOf[get_int()];
    get_int();
  }
  for ( int i = 1; i <= N; ++i)
    offsetOf[i] += offsetOf[i - 1];
  offsetOf[N + 1] = M;
  head = buffer;
  get_int(), get_int(), get_int();
  for ( int i = 0; i < M; ++i) {
     int a = get_int(), b = get_int();
    muchii[--offsetOf[a]] = b;
  }
  BFS(S);
  for ( int i = 1; i <= N; ++i)
    put_int(dst[i]);
  fwrite(buffer, 1, writeHead - buffer, stdout);
  return 0;
}