Cod sursa(job #1401247)

Utilizator teoceltareconstantin teodor teoceltare Data 25 martie 2015 18:43:20
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.34 kb
#include<fstream>
#include<iostream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s,a[100010];
struct nod
{
    int val;
    nod *nxt;
} *v[100010], *p, *u;
void citire()
{
    int x,y;
    nod *k;
    fin>>n>>m>>s;
    for(int a1=1;a1<=n;a1++)
    {
        k=new(nod);
        k->val=0;
        v[a1]=k;
    }

    k=new(nod);
    k->val=s;
    u=k;
    k=new(nod);
    k->nxt=u;
    p=k;
    for(int a1=1;a1<=m;a1++)
    {
        fin>>x>>y;
        k=new(nod);
        k->val=y;
        k->nxt=v[x];
        v[x]=k;
    }
}
void fct()
{
    nod *k;
    int x,y;
    while(p!=u)
    {
        p=p->nxt;
        x=p->val;
        while(v[x]->val)
        {
            y=v[x]->val;
            if(a[y]==0 and y!=s and y!=x)
            {
                a[y]=a[x]+1;
                k=new(nod);
                k->val=y;
                u->nxt=k;
                u=k;
            }
            v[x]=v[x]->nxt;
        }
    }
}
int main()
{
    citire();
    fct();
    for(int a1=1;a1<s;a1++)
    {
        if(a[a1]==0)
        {
            a[a1]=-1;
        }
        fout<<a[a1]<<" ";
    }
    fout<<"0"<<" ";
    for(int a1=s+1;a1<=n;a1++)
    {
        if(a[a1]==0)
        {
            a[a1]=-1;
        }
        fout<<a[a1]<<" ";
    }
}