Cod sursa(job #1883948)

Utilizator lauratalaatlaura talaat lauratalaat Data 18 februarie 2017 12:34:40
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include<stdio.h>
#include<vector>
using namespace std;
vector<int>v[100001];
int viz[100001],coada[1000001],dist[100001];
int n,m,s;
void citire (){
    int i,x,y;
    scanf("%d%d%d",&n,&m,&s);
    for(i=1;i<=m;i++){
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
}
void bfs ( int nod ){
    int st,dr,i;
    viz[nod]=1;
    st=dr=1;
    coada[st]=nod;
    for(i=1;i<=n;i++)
        dist[i]=-1;
    dist[nod]=0;
    while(st<=dr){
        nod=coada[st];
        for(i=0;i<v[nod].size();i++)
            if(viz[v[nod][i]]==0){
                viz[v[nod][i]]=1;
                coada[++dr]=v[nod][i];
                dist[v[nod][i]]=dist[nod]+1;
            }
        st++;
    }
}
int main(){
    int i,j;
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    citire();
    bfs(s);
    for(i=1;i<=n;i++)
        printf("%d ",dist[i]);
    return 0;
}