Cod sursa(job #3005105)

Utilizator biancalautaruBianca Lautaru biancalautaru Data 16 martie 2023 19:24:20
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.74 kb
#include <fstream>
#include <vector>
#include <deque>
#define DIM 100001
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,p,x,y,d[DIM];
vector<int> l[DIM];
deque<int> q;
int main() {
    fin>>n>>m>>p;
    while (m--) {
        fin>>x>>y;
        l[x].push_back(y);
    }
    for (int i=1;i<=n;i++)
        d[i]=-1;
    d[p]=0;
    q.push_back(p);
    while (!q.empty()) {
        int nod=q.front();
        q.pop_front();
        for (int i=0;i<l[nod].size();i++) {
            int vec=l[nod][i];
            if (d[vec]==-1) {
                d[vec]=d[nod]+1;
                q.push_back(vec);
            }
        }
    }
    for (int i=1;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}