Pagini recente » Cod sursa (job #703800) | Cod sursa (job #2775322) | Cod sursa (job #340959) | Cod sursa (job #1390948) | Cod sursa (job #1737924)
#include <cstdio>
#include <vector>
#include <queue>
#define NMAX 100005
using namespace std;
vector <int> g[NMAX];
queue <int> q;
int drum[NMAX],i,n,m,s,x,y,crt;
int main()
{
freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
scanf("%d %d %d",&n,&m,&s);
for (i=1; i<=m; i++)
{
scanf("%d %d",&x,&y);
g[x].push_back(y);
}
for (i=1; i<=n; i++) drum[i]=-1;
drum[s]=0;
q.push(s);
while (!q.empty())
{
crt=q.front();
q.pop();
for (i=0; i<g[crt].size(); i++)
{
if (drum[g[crt][i]]==-1)
{
drum[g[crt][i]]=drum[crt]+1;
q.push(g[crt][i]);
}
}
}
for (i=1; i<=n; i++) printf("%d ",drum[i]);
return 0;
}