Cod sursa(job #2053751)

Utilizator mlc_oficialBoris Barca mlc_oficial Data 1 noiembrie 2017 11:43:37
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.31 kb
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <iostream>
#include <cstring>
#include <fstream>
#include <vector>

using namespace std;

constexpr int kMaxN = 100000, kMaxM = 1000000;

int offset[kMaxN + 1], vertex[kMaxM];
pair<int, int> edge[kMaxM];
int dist[kMaxN], bfq[kMaxN];

int main() {
    #ifdef INFOARENA
    ifstream cin("bfs.in");
    ofstream cout("bfs.out");
    #endif
    
    int n, m, s; cin >> n >> m >> s; s -= 1;
    
    for (int i = 0; i < m; i += 1) {
        int x, y; cin >> x >> y; x -= 1; y -= 1;
        offset[x] += 1;
        edge[i] = make_pair(x, y);
    }
    
    for (int i = 1; i <= n; i += 1) {
        offset[i] += offset[i - 1];
    }
    for (int i = 0; i < m; i += 1) {
        vertex[--offset[edge[i].first]] = edge[i].second;
    }
    
    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 = offset[node]; i != offset[node + 1]; i += 1) {
            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];
    }
}