Cod sursa(job #1312594)

Utilizator RazecBotez Cezar Razec Data 9 ianuarie 2015 19:13:03
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include <fstream>
#include <vector>
using namespace std;
int N,M,x,a,b,t,d[100010],Q[100010];
vector <int> v[100010];
ifstream f("bfs.in");
ofstream g("bfs.out");
int main()
{
    f>>N>>M>>x;
    for(;M;M--)
    {
        f>>a>>b;
        v[a].push_back(b);
    }
  d[x]=1;
  t=b=1;Q[t]=x;
  for(;b<=t;b++)
  {
      x=Q[b];
      for(auto i:v[x])
        if(!d[i])
      {
          d[i]=d[x]+1;
          Q[++t]=i;
      }

  }
  for(int i=1;i<=N;i++)
    g<<d[i]-1<<" ";
    return 0;
}