Pagini recente » Cod sursa (job #1434460) | Cod sursa (job #186928) | Profil arissaelena | Cod sursa (job #1510093) | Cod sursa (job #2428454)
#include <cstdio>
#include <vector>
using namespace std;
#define maxsize 100005
int n, m, s, x, y;
vector<int> gr[maxsize];
int c[maxsize], niv[maxsize], lg[maxsize];
void bfs(int a)
{
int u;
for(int i = 0; i < maxsize; ++i)
niv[i] = -1;
int l = 1;
c[l] = a;
niv[a] = 0;
for(int i = 1; i <= l; ++i)
{
u = c[i];
for(int j = 0; j < lg[u]; ++j)
if(niv[gr[u][j]] == -1)
{
c[++l] = gr[u][j];
niv[gr[u][j]] = niv[u]+1;
}
}
}
int main()
{
freopen("bfs.in", "r", stdin);
freopen("bfs.out", "w", stdout);
scanf("%d %d %d", &n, &m, &s);
for(int i = 0; i < m; ++i)
{
scanf("%d %d", &x, &y);
gr[x].push_back(y);
}
for(int i = 1; i <= n; ++i)
lg[i] = gr[i].size();
bfs(s);
for(int i = 1; i <= n; ++i)
printf("%d ", niv[i]);
return 0;
}