Pagini recente » Cod sursa (job #1360322) | Cod sursa (job #99444) | Cod sursa (job #1363877) | Cod sursa (job #428259) | Cod sursa (job #1053094)
#include <fstream>
#include<vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int>G[100005];
int D[100005],c[100005],n,m,s;
bool use[100005];
int main()
{
fin>>n>>m>>s;
for(int i=1;i<=m;i++)
{
int x,y;
fin>>x>>y;
G[x].push_back(y);
}
c[1]=s;int k=1;
use[s]=1;
for(int i=1;i<=k;i++)
{
int nod=c[i];
for(unsigned int j=0;j<G[nod].size();j++)
{
int vecin=G[nod][j];
if(!use[vecin])
{
c[++k]=vecin;
D[vecin]=D[nod]+1;
use[vecin]=1;
}
}
}
for(int i=1;i<=n;i++)
if(D[i]==0&&i!=s)
fout<<-1<<" ";
else
fout<<D[i]<<" ";
return 0;
}