Cod sursa(job #2144190)

Utilizator RaduNRadu Negovan RaduN Data 26 februarie 2018 16:28:53
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> gr[100001];
int d[100001], m, s, q[100001], n;
int main() {
    int x, y;
    f>>n>>m>>s;
    for(int i=0; i<m; i++) {
        f>>x>>y;
        gr[x].push_back(y);
    }
    int i;
    int st=0,dr=-1;
    for(i=1; i<=n; i++){
        d[i]=-1;
    }
    q[++dr]=s;
    d[s]=0;
    while(st<=dr) {
        x=q[st++];
        for(i=0; i<gr[x].size(); i++) {
            y=gr[x][i];
            if(d[y]==-1) {
                q[++dr]=y;
                d[y]=1+d[x];
            }
        }
    }
    for(i=1; i<=n; i++){
        g<<d[i]<<" ";
    }
    return 0;
}