Pagini recente » Cod sursa (job #1140829) | Cod sursa (job #1907675) | Cod sursa (job #881179) | Cod sursa (job #2898040) | Cod sursa (job #1418153)
#include <iostream>
#include <fstream>
#define MAX 100005
using namespace std;
ifstream f ("bfs.in");
ofstream g ("bfs.out");
int x,y,m,n,s,i,j,r[MAX],c[MAX],v[MAX],inc,sf;
struct muchie
{
int x,y;
}a[MAX];
int main()
{
f>>n>>m>>s;
for (i=1;i<=n;i++) v[i]=-1;
v[s]=0;
r[0]=1;
for (i=1;i<=m;i++)
{
f>>a[i].x>>a[i].y;
r[i]=i+1;
}
for (i=1;i<m;i++)
{
for (j=1+i;j<=m;j++)
{
if (a[i].x>a[j].x)
{
a[0]=a[i];
a[i]=a[j];
a[j]=a[0];
}
else if (a[i].x==a[j].x)
{
if (a[i].y>a[j].y)
{
a[0]=a[i];
a[i]=a[j];
a[j]=a[0];
}
}
}
}
c[0]=s;
while (inc<=sf)
{
x=c[inc];
inc++;
y=r[0];
while (y<=m&&a[y].x!=x) y=r[y];
while (y<=m&&a[y].x==x)
{
if (v[a[y].y]==-1)
{
c[++sf]=a[y].y;
v[a[y].y]=v[x]+1;
}
y=r[y];
}
}
for (i=1;i<=n;i++)
g<<v[i]<<' ';
return 0;
}