Cod sursa(job #2355487)

Utilizator bogdan_modoleaBogdan Modolea bogdan_modolea Data 26 februarie 2019 09:21:04
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <bits/stdc++.h>
#define NMAX 100005
using namespace std;

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

vector <int> v[NMAX];
int c[NMAX],vizitat[NMAX],distanta[NMAX];


int n,m,s;

void bfs(int x)
{
    int p,u;
    p=u=1;
    c[u]=x; vizitat[x]=1; distanta[x]=0;
    while(p<=u)
    {
        x=c[p++];
        for(auto i:v[x])
        {
            if(vizitat[i]==0)
            {
                distanta[i]=distanta[x]+1;
                vizitat[i]=1;
                c[++u]=i;
            }
        }
    }

}

int main()
{
    int x,y,i;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    bfs(s);
    for(i=1;i<=n;i++)
    {
        if(vizitat[i]==1) fout<<distanta[i]<<" ";
        else fout<<-1<<" ";
    }
    return 0;
}