Cod sursa(job #2267172)

Utilizator PeraPera Alexandru Pera Data 23 octombrie 2018 13:16:08
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.64 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> V[100001];
int viz[100001],q[100001],n,m,s,i,x,y;
void coada(int x){
    int lc,cc,ln,cn,p,u,i,k;

p=u=1;
q[p]=x;
viz[x]=1;
while(p<=u){
      k=q[p];
      p++;
      for(i=0;i<V[k].size();i++)
          if(viz[V[k][i]]==0){
             u++;
             q[u]=V[k][i];
             viz[V[k][i]]=viz[k]+1;
      }
}


}
int main()
{fin>>n>>m>>s;
for(i=1;i<=m;i++){
    fin>>x>>y;
    V[x].push_back(y);
}

coada(s);
for(i=1;i<=n;i++)
    fout<<viz[i]-1<<" ";


    return 0;
}