Cod sursa(job #3263725)

Utilizator mihnea_ciobotaruCiobotaru Mihnea mihnea_ciobotaru Data 16 decembrie 2024 11:27:57
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.76 kb
#include <fstream>
#include <vector>
#define NMAX 100001

using namespace std;

ifstream fin ("bfs.in");
ofstream fout ("bfs.out");

int n, start;
vector<int> a[NMAX];
int viz[NMAX];
int C[NMAX];
int inc, sf;

void citire()
{
    int m, i, x, y;
    fin>>n>>m>>start;
    for(i=0; i<m; i++)
    {
        fin>>x>>y;
        a[x].push_back(y);
    }
}

void bfs(int x)
{
  int i;
  viz[x]=1; C[1]=x; inc=sf=1;

  while(inc<=sf)
  {
    x=C[inc++];
    for(i=0; i<a[x].size(); i++)
      if(!viz[a[x][i]])
      {
        viz[a[x][i]]=1+viz[x];
        C[++sf]=a[x][i];
      }
  }
}

int main()
{
    int i;
    citire();
    bfs(start);
    for(i=1; i<=n; i++)
      fout<<viz[i]-1<<' ';
    fout.close();
    return 0;
}