Cod sursa(job #859153)

Utilizator robert.onesimRobert Onesim robert.onesim Data 19 ianuarie 2013 19:29:09
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include <fstream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
struct codita
{
    int nr,cost;
    bool ok;
} C[100000],viz[10000];
int n,m,s,ic,sc,v,v1,A[10000][10000],i;
void bfs(int x)
{
    C[1].nr=x; C[1].cost=0;viz[x].ok=1;viz[x].cost=0;
    ic=1;sc=1;
    while(ic<=sc)
    {
        v=C[ic].nr;
        v1=C[ic++].cost;
        for(i=1;i<=n;i++)
        {
            if(A[v][i]==1&&viz[i].ok==0)
            {
               C[++sc].nr=i;C[sc].cost=v1+1;
               viz[i].ok=1; viz[i].cost=v1+1;
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        if(viz[i].cost==0&&i!=s) fout<<"-1"<<" ";
        else fout<<viz[i].cost<<" ";
    }

}

int main()
{
    int x,y;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        A[x][y]=1;
    }
    bfs(s);
}