Cod sursa(job #2046014)

Utilizator catalinaenachiCatalina Enachi catalinaenachi Data 23 octombrie 2017 11:45:30
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>
#include <vector>
#define nm 100001
using namespace std;
ifstream fin("bfs.in");
ofstream fout ("bfs.out");

struct nod {int x;
nod *urm;
};
nod*p[nm];
int c[nm], viz[nm], n,m;
void adauga(int a, nod*&p)
{
    nod*q;
    q=new nod;
    q->x=a;
    q->urm=p;
    p=q;
}
int main()
{
    int x,y,i,u,s,z,primul;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
       { fin>>x>>y;
        if(x!=y) adauga(y,p[x]);
       }
    c[1]=s;
    viz[s]=1;
    primul=u=1;
    while(primul<=u)
    {
        z=c[primul]; primul++;
        nod*q;
        for(q=p[z];q!=NULL;q=q->urm)
        {
            y=q->x;
            if(viz[y]==0)
            {
                viz[y]=viz[z]+1;
                u++;
                c[u]=y;
            }
        }
    }
    for(i=1;i<=n;i++)
        fout<<viz[i]-1<<' ';
    return 0;
}