Pagini recente » Cod sursa (job #1551303) | Cod sursa (job #1560344) | Monitorul de evaluare | Cod sursa (job #150111) | Cod sursa (job #2420466)
#include<fstream>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s,a,b,v[1003][1003],coada[1003],st,dr,sol[1003],nod;
int main()
{
f>>n>>m>>s;
for(int i=1;i<=m;i++)
{
f>>a>>b;
v[a][b]=1;
}
coada[1]=s;
st=1; dr=1;
for(int i=1;i<=n;i++)
sol[i]=-1;
sol[s]=0;
while(st<=dr)
{
nod=coada[st];
++st;
for(int i=1;i<=n;++i)
{
if(!v[nod][i]) continue;
if(sol[i]!=-1) continue;
++dr;
coada[dr]=i;
sol[i]=sol[nod]+1;
}
}
for(int i=1;i<=n;++i)
g<<sol[i]<<' ';
return 0;
}