Cod sursa(job #2647257)

Utilizator benz87Harshit Gupta benz87 Data 3 septembrie 2020 18:55:00
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 2.08 kb
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define ll long long int

const int inf=1e9+10;

ifstream in("bfs.in");
ofstream out("bfs.out");

int main(){
    int n,m,st;
    in>>n>>m>>st;
    vector<vector<int>> g(n+1);
    int u,v;
    for(int i=0;i<m;i++){
        in>>u>>v;
        g[u].push_back(v);
    }
    queue<int> q;
    vector<bool> inc(n+1,false);
    vector<int> d(n+1,inf);
    d[st]=0;
    q.push(st);
    while(q.size()){
        u=q.front();
        q.pop();
        inc[u]=false;
        for(auto v:g[u]){
            if(d[v]>d[u]+1){
                d[v]=d[u]+1;
                if(!inc[v]){
                    q.push(v);
                    inc[v]=true;
                }
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(d[i]==inf){
            out<<"-1 ";
        }
        else{
            out<<d[i]<<" ";
        }
    }
    out<<"\n";
    return 0;
}