Cod sursa(job #1536929)

Utilizator alittlezzCazaciuc Valentin alittlezz Data 26 noiembrie 2015 19:41:41
Problema BFS - Parcurgere in latime Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using namespace std;

int s;
vector <int> v[100005];
int viz[100005];

void dfs(int nod, int p){
    viz[nod] = (nod == s ? 1 : p);
    for(auto it : v[nod]){
        if(!viz[it]){
             dfs(it, p+1);
        }
    }
}

int main()
{
    int n,m,x,y,i;
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    scanf("%d %d %d",&n,&m,&s);
    for(i = 1;i <= m;i++){
        scanf("%d %d",&x,&y);
        if(x != y){
            v[x].pb(y);
        }
    }
    dfs(s, 1);
    for(i = 1;i <= n;i++){
        if(i == s){
            printf("0 ");
        }else if(viz[i] == 0){
            printf("-1 ");
        }else{
            printf("%d ",viz[i]-1);
        }
    }
    return 0;
}