Pagini recente » Cod sursa (job #1916755) | Cod sursa (job #2139846) | Cod sursa (job #184220) | Cod sursa (job #232025) | Cod sursa (job #1052795)
# include <cstdio>
# include <vector>
# include <queue>
# define nmax 100001
using namespace std;
int n,m,s,viz[nmax],x,y;
queue <int>q;
vector <int>G[nmax];
inline void bfs(int x)
{
int i;
viz[x]=1;q.push(x);
while(!q.empty())
{
x=q.front();q.pop();
for(i=0;i<G[x].size();++i)
if(!viz[G[x][i]])
{
q.push(G[x][i]);
viz[G[x][i]]=viz[x]+1;
}
}
}
int main()
{
int i;
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);
}
bfs(s);
for(i=1;i<n;++i)
printf("%d ",viz[i]-1);
printf("%d\n",viz[n]-1);
return 0;
}