Cod sursa(job #2199240)

Utilizator EdgeLordXDOvidiuPita EdgeLordXD Data 26 aprilie 2018 22:54:48
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <bits/stdc++.h>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
#define N 100001
int q[N];
vector<int> a[N];
int r[N];
bool v[N];
int main(){
    int n,m,s,x,y,i;
    in>>n>>m>>s;
    for(i=1; i<=m; ++i)
        in>>x>>y, a[x].push_back(y);
    int p=1, u=1;
    for(i=1; i<=n; ++i)
        r[i]=-1;
    q[1]=s;
    r[s]=0;
    v[s]=1;
    int c, nr=0;
    while(p<=u){
        c=q[p++];
        ++nr;
        for(i=0; i<a[c].size(); ++i){
            if(!v[a[c][i]]){
                v[a[c][i]]=1, q[++u]=a[c][i];
                r[a[c][i]]=r[c]+1;
            }
        }
    }
    for(i=1; i<=n; ++i)
        out<<r[i]<<" ";
    return 0;
}