Cod sursa(job #2487715)

Utilizator hunting_dogIrimia Alex hunting_dog Data 5 noiembrie 2019 18:10:13
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.7 kb
#include <iostream>
#include <fstream>
#include <bitset>

#define NMAX 100000

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

bitset <NMAX> v[NMAX];
bitset <NMAX> viz,res;
int n;

void bfs(int s,int nr)
{
    int t[100],k=0;
    for(int i=1;i<=n;++i)
        if(v[s][i] && !viz[i])
    {
        t[k++]=i;
        res[i]=nr;
    }
    for(int i=0;i<k;++i)
        bfs(t[i],nr+1);
}

int main()
{
    int m,s,k=0,nr=0;
    f>>n>>m>>s;
    for(int i=1;i<=n;++i)
        res[i]=-1;
    while(m--)
    {
        int x,y;
        f>>x>>y;
        v[x][y]=1;
    }
    res[s]=0;
    viz[s]=1;
    bfs(s,1);
    for(int i=1;i<=n;++i)
        g<<res[i]<<' ';
}