Cod sursa(job #1231163)

Utilizator andreey_047Andrei Maxim andreey_047 Data 19 septembrie 2014 19:18:14
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <cstdio>
#include <iostream>
#define iN "bfs.in","r",stdin
#define oUt "bfs.out","w",stdout
#define nmax 100005
#include <vector>
using namespace std;
int n,m,s,D[nmax],nr[nmax],C[nmax];
vector<int>Q[nmax];
inline void Create(){
 int i;
 for(i=0;i<nmax;i++)
    D[i]=-1;
}
int main(){
    int i,x,y,k=1,j;
 freopen(iN);
 freopen(oUt);
 scanf("%d%d%d",&n,&m,&s);
 for(i=1;i<=m;i++){
    scanf("%d%d",&x,&y);
    Q[x].push_back(y);
 }
 for(i = 1;i<=n;i++)
    nr[i] = Q[i].size();
 Create();
 C[1] = s;
 D[s]=0;
 for(i=1;i<=k;i++)
    for(j = 0; j < nr[C[i]]; j++)
     if(D[Q[C[i]][j]]==-1){
            C[++k] = Q[C[i]][j];
    D[C[k]] = D[C[i]] + 1;

     }
  for(i=1;i<=n;i++)
    cout << D[i]<<' ';
return 0;
}