Cod sursa(job #1968489)

Utilizator cristibogdanPatrascu Cristian cristibogdan Data 17 aprilie 2017 18:40:34
Problema BFS - Parcurgere in latime Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int i,j,n,m,s,p,u,d[100005],q[400001],x,y,viz[100005];
vector <int> G[100005];
void bfs(){
    while(p<=u){
            viz[q[p]]=1;
    for(i=0;i<G[q[p]].size();i++)
        if(viz[G[q[p]][i]]==0){
            d[G[q[p]][i]]=d[q[p]]+1;
            q[++u]=G[q[p]][i];
            viz[q[u]]=1;
            }
        p++;
    }
}
int main()
{
  f>>n>>m>>s;
  for(i=1;i<=m;i++){
    f>>x>>y;
    d[i]=-1;
    G[x].push_back(y);
  }
  d[s]=0;
  p=u=1;
  q[1]=s;
  viz[s]=1;
  bfs();
  for(i=1;i<=n;i++)
    g<<d[i]<<" ";
    return 0;
}