Cod sursa(job #1922846)

Utilizator al3xionescuIonescu Alexandru al3xionescu Data 10 martie 2017 19:14:26
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <fstream>

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s,x,y,a[3000][3000],C[10000],viz[10000],i,nr,p,u,j,ok;
void BF(int r)
{p=u=1;
ok=1;
C[1]=r;
viz[r]=1;
    while(p<=u)
    {for(i=1;i<=n;i++)
    if(a[C[p]][i]==1&&viz[i]==0)
    {viz[i]=1;u++;nr++;if(i==j) {ok=0;i=n+1;p=u+1;}
    C[u]=i;/*fout<<i<<' ';*/
    }
        p++;
    }
    for(int t=2;t<=u;t++)
    {viz[C[t]]=0;C[t]=0; }
}
int main()
{fin>>n>>m>>s;
for(i=1;i<=m;i++)
{
fin>>x>>y;
a[x][y]=1;}
for(j=1;j<=n;j++)
    if(j==s) fout<<'0'<<' ';
else {nr=0;
    BF(s);
    if(ok) nr=-1;
    fout<<nr<<' ';
}

    return 0;
}