Cod sursa(job #1831668)

Utilizator Valentin0709Datcu George Valentin Valentin0709 Data 18 decembrie 2016 15:11:35
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include<stdio.h>
using namespace std;

FILE*f=fopen("bfs.in","r");
FILE*g=fopen("bfs.out","w");

struct nod {
    int inf;
    nod *urm;
} *v[100005];

int n,m,s,x,y,i,q[100005],d[100005];

void adaug(nod *&a, int x) {
    nod *p=new nod;
    p->inf=x; p->urm=a;
    a=p;
}

void bf(int x) {
    int p=1,u=1;
    nod *j;
    q[1]=x; d[x]=0;
    while(p<=u) {
        for(j=v[x];j!=NULL;j=j->urm)
            if(d[j->inf]==-1) {
                d[j->inf]=1;
                q[++u]=j->inf;
                d[j->inf]=d[x]+1;
            }
        p++; x=q[p];
    }
}

int main() {
    fscanf(f,"%d%d%d",&n,&m,&s);

    for(i=1;i<=m;i++) {
        fscanf(f,"%d%d",&x,&y);
        adaug(v[x],y);
    }

    for(i=1;i<=n;i++) d[i]=-1;
    bf(s);
    for(i=1;i<=n;i++) fprintf(g,"%d ",d[i]);

    return 0;
}