Cod sursa(job #2509514)

Utilizator olteanupetru02Olteanu Petru olteanupetru02 Data 14 decembrie 2019 12:13:20
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.08 kb
#include <fstream>

using namespace std;

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

const int N = 100000;
const int M = 10*N;
int lst[N],vf[2*M],urm[2*M],n,nr,viz[2*M],m,x,y,s,q[2*M],d[2*M];

void adaugare(int x,int y){
    vf[++nr] = y;
    urm[nr] = lst[x];
    lst[x] = nr;
}

void bfs(int x0){
    int st,dr;
    for(int i=1;i<=n;i++)
        d[i] = -1;
    st = 0;
    dr = -1;
    q[++dr] = x0;
    while(st <= dr){
        int x = q[st++];
        for(int p = lst[x]; p != 0 ;p = urm[p]){
            int y = vf[p];
            if(d[y] == -1){
                q[++dr] = y;
                d[y] = 1 + d[x];
            }
        }
    }
}
int main()
{
    in >> n >> m >> s;
    for(int i = 1; i <= m; i++){
        in >> x >> y;
        adaugare(x,y);
        adaugare(y,x);
    }
    bfs(s);
    for (int i = 1; i <= n; i++)
        if (i == s)
            out << 0 << ' ';
        else {
            if (viz[i] == 0)
                out << -1 << ' ';
            else
                out << viz[i] << ' ';
        }
    return 0;
}