Cod sursa(job #1185803)

Utilizator ducu34Albastroiu Radu Gabriel ducu34 Data 16 mai 2014 22:07:17
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <fstream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int a[10001][10001],n,m,s,i,p,u,c[100001],viz[100000],x,y;
int main()
{
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        a[x][y]=1;
    }
    p=u=1;
    c[p]=s;
    viz[s]=1;
    while(u<=p)
    {
        for(i=1;i<=n;i++)
        {
            if(a[c[u]][i] && viz[i]==0)
            {
                p++;
                c[p]=i;
                viz[i]=viz[c[u]]+1;
            }
        }
        u++;
    }
    for(i=1;i<s;i++)
    {
        if(viz[i]==0)
        fout<<-1<<" ";
        else
        fout<<viz[i]-1<<" ";
    }
    fout<<0<<" ";
    for(i=s+1;i<=n;i++)
    {
        if(viz[i]==0)
        fout<<-1<<" ";
        else
        fout<<viz[i]-1<<" ";
    }
    return 0;
}