Cod sursa(job #2667907)

Utilizator marian222200Dimofte Marian marian222200 Data 4 noiembrie 2020 01:35:10
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.99 kb
#include<fstream>
#define N 100001
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
struct nod
{
    int info;
    nod* urm;
};
nod* l[N];
nod* p;
int n,m,s;
int dist[N];
int c[N];
void bfs(int s)
{
    int pr,ul,i,j;
    pr=ul=1;
    c[1]=s;
    dist[s]=0;
    while(pr<=ul)
    {
        i=c[pr++];
        p=l[i];
        while(p!=NULL)
        {
            j=p->info;
            if(dist[j]==-1)
            {
                c[++ul]=j;
                dist[j]=dist[i]+1;
            }
            p=p->urm;
        }
    }
}
void citire()
{
    int x,y,i;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
    	fin>>x>>y;
        p=new nod;
        p->info=y;
        p->urm=l[x];
        l[x]=p;
    }
}
void initializare(){
    for(int i=0;i<=n;i++)dist[i]=-1;
}
void afisare(){
    int i;
    for(i=1;i<=n;i++)fout<<dist[i]<<" ";
}
int main()
{
    citire();
    initializare();
    bfs(s);
    afisare();
    return 0;
}