Cod sursa(job #544803)

Utilizator tudorDudeTudor Vioreanu tudorDude Data 2 martie 2011 10:04:04
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
# include <iostream>
# include <fstream>
using namespace std;
fstream f("bfs.in",ios::in);
fstream g("bfs.out",ios::out);
int gr[100000][1000],x,y,s,c[100000],n,m,i,p,pas[100000],viz[100000],u,v;
int main()
{
f>>n>>m>>s;
for (i=1;i<=n;i++)
   pas[i]=-1;
for (i=1;i<=m;i++)
{
f>>x>>y;
gr[x][0]++;
gr[x][gr[x][0]]=y;
}
p=u=1;
c[p]=s;
viz[s]=1;
pas[s]=0;
while (p<=u)
{
x=c[p];
for (i=1;i<=gr[x][0];i++)
{
v=gr[x][i];
if (viz[v]==0)
{
u++;
c[u]=v;
viz[v]=1;
pas[v]=pas[v]+1;
}
p++;
}
}
//for (i=1;i<=u;i++)
//if(viz[i]==0) pas[i]=-1;
for (i=1;i<=n;i++)
g<<pas[i]<<" ";
g<<"\n";
f.close();
g.close();
return 0;
}