Cod sursa(job #1095311)

Utilizator TelcontarTiberiu Micu Telcontar Data 30 ianuarie 2014 17:56:29
Problema BFS - Parcurgere in latime Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include<fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
long N,M,a[20000][20000],i,j,v[20000],x,y,u[20000],S;
int main()
{
    f>>N>>M>>S;
    for(i=1;i<=N;i++)
        for(j=1;j<=N;j++)
       {
           a[i][j]=0;
           v[i]=0;
           u[i]=0;
       }
    for(i=1;i<=M;i++)
  { f>>x>>y; a[x][y]=1; }
  for(i=1;i<=N;i++)
   if(a[S][i]==1) { v[i]=1; u[i]=1; }
   for(i=1;i<=N;i++)
    for(j=1;j<=N;j++)
    if(a[i][j]==1 && v[i]==1 && v[j]==0)
   {
       u[j]=u[i]+1; v[j]=1;
   }
  for(i=1;i<=N;i++) if(u[i]==0) u[i]=-1;
   u[S]=0;
  for(i=1;i<=N;i++) g<<u[i]<<" ";

  return 0;
}