Cod sursa(job #1848516)

Utilizator llalexandruLungu Alexandru Ioan llalexandru Data 16 ianuarie 2017 09:38:12
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <fstream>
#include <vector>

using namespace std;

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

vector <int> V[100005];

int n, m, s, i, x, y;
int F[100005], D[100005];

struct coada{int x, y;};
coada Cd[100005];

int main()
{
    int i, dist=0, st, fi;
    fin>>n>>m>>s;
    for (i=1; i<=m; i++)
    {
        fin>>x>>y;
        V[x].push_back(y);
    }
    for (i=1; i<=n; i++)
        D[i]=-1;
    D[s]=0;
    Cd[1].x=s;
    Cd[1].y=0;
    st=1;
    fi=1;
    while(st<=fi)
    {
        x=Cd[st].x;
        dist=Cd[st].y;
        st++;
        for (i=0; i<V[x].size(); i++)
        {
            if (D[V[x][i]]==-1)
            {
                D[V[x][i]]=dist+1;
                fi++;
                Cd[fi].x=V[x][i];
                Cd[fi].y=dist+1;
            }
        }
    }
    for (i=1; i<=n; i++)
        fout<<D[i]<<" ";
    return 0;
}