Cod sursa(job #2649745)

Utilizator mihnea03Ciocioiu Mihnea mihnea03 Data 16 septembrie 2020 10:09:53
Problema BFS - Parcurgere in latime Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.87 kb
#include <fstream>
#include <vector>
#include <climits>
#define dim 100010
using namespace std;
vector <int> a[dim];
int f[dim];
int d[dim];
int c[dim];
int i,n,m,p,u,nod,vecin,s,x,y;

int main() {
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    fin>>n>>m>>s;
    for (i=1;i<=m;i++) {
        fin>>x>>y;
        a[x].push_back(y);
    }
    for (i=1;i<=n;i++) {
        d[i]=INT_MAX;
    }
    p=u=1;
    c[p]=s;
    d[s]=0;
    f[s]=1;
    while (p<=u) {
        nod=c[p];
        for (i=0;i<a[nod].size();i++) {
            vecin=a[nod][i];
            if (f[vecin]==0) {
                f[vecin]=1;
                d[vecin]=d[nod]+1;
                c[++u]=vecin;
            }
        }
        p++;
    }
    for (i=1;i<=n;i++) {
        if (d[i]!=INT_MAX) fout<<d[i]<<" ";
        else fout<<-1<<" ";
    }
    return 0;
}