Pagini recente » Cod sursa (job #862383) | Cod sursa (job #2976825) | Cod sursa (job #2984234) | Cod sursa (job #1968344) | Cod sursa (job #3003466)
#include <fstream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s,x,y,A[100001][1000001],c[1000],p;
bool viz[1000];
void drum(int i)
{
for (int j=1;j<=A[i][0];j++) if (!viz[A[i][j]]) {
if (c[A[i][j]]==-1||c[A[i][j]]>c[i]+1) {
c[A[i][j]]=c[i]+1;
viz[A[i][j]]=1;
drum(A[i][j]);
viz[A[i][j]]=0;
}
}
}
int main()
{
fin>>n>>m>>s;
for (int i=1;i<=n;i++) c[i]=-1;
while (m--) {
fin>>x>>y;
A[x][++A[x][0]]=y;
}
c[s]=0;
viz[s]=1;
drum(s);
for (int i=1;i<=n;i++) fout<<c[i]<<" ";
fout<<'\n';
return 0;
}