Cod sursa(job #3003466)

Utilizator gogu2091Ganea Andrei Mircea gogu2091 Data 15 martie 2023 19:04:51
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-32 Status done
Runda Arhiva educationala Marime 0.68 kb
#include <fstream>
using namespace std;

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

int n,m,s,x,y,A[100001][1000001],c[1000],p;
bool viz[1000];

void drum(int i)
{
    for (int j=1;j<=A[i][0];j++) if (!viz[A[i][j]]) {
        if (c[A[i][j]]==-1||c[A[i][j]]>c[i]+1) {
            c[A[i][j]]=c[i]+1;
            viz[A[i][j]]=1;
            drum(A[i][j]);
            viz[A[i][j]]=0;
        }
    }
}

int main()
{
    fin>>n>>m>>s;
    for (int i=1;i<=n;i++) c[i]=-1;
    while (m--) {
        fin>>x>>y;
        A[x][++A[x][0]]=y;
    }
    c[s]=0;
    viz[s]=1;
    drum(s);
    for (int i=1;i<=n;i++) fout<<c[i]<<" ";
    fout<<'\n';
    return 0;
}