Pagini recente » Cod sursa (job #589781) | Cod sursa (job #1327973) | Cod sursa (job #2132929) | Cod sursa (job #926277) | Cod sursa (job #2432176)
#include <fstream>
#include <cstring>
#include <vector>
#include <deque>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s,x,y,i,q[100005],d[100005];
bool viz[100005];
vector <int> g[100005];
void coada(){
viz[s]=1;
int p=1,u=1;
q[p]=s;
d[s]=0;
while(p<=u){
int nod=q[p];
for(int i=0;i<g[nod].size();i++)
if(viz[g[nod][i]]==0){
q[++u]=g[nod][i];
d[g[nod][i]]=d[nod]+1;
viz[g[nod][i]]=1;
}
p++;
}
}
int main()
{
fin>>n>>m>>s;
for(i=1;i<=m;i++){
fin>>x>>y;
g[x].push_back(y);
}
coada();
for(i=1;i<=n;i++){
if(!viz[i])
fout<<-1<<' ';
else
fout<<d[i]<<' ';
}
return 0;
}