Cod sursa(job #1083739)

Utilizator TarabanDragosTaraban Dragos-Petru TarabanDragos Data 16 ianuarie 2014 12:49:53
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <fstream>
# include <vector>

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

vector <int> l[100010];

int n,m,v[100010],d[100010],s,i,j,p,u,x,y,c[100010];

int main () {

    fin>>n>>m>>s;
    for (i=1;i<=m;i++) {
        fin>>x>>y;
        l[x].push_back(y);
    }
    c[1]=s;
    p=u=1;
    d[s]=1;
    v[s]=1;
    while (p<=u) {
        x=c[p];
        for (i=0;i<l[x].size();i++) {
            if (v[l[x][i]]==0) {
                c[++u]=l[x][i];
                d[l[x][i]]=d[x]+1;
                v[l[x][i]]=1;
            }
        }
        p++;
    }

    for (i=1;i<=n;i++)
        fout<<d[i]-1<<" ";


    return 0;
}