Pagini recente » Cod sursa (job #1132684) | Cod sursa (job #1340928) | Cod sursa (job #942844) | Cod sursa (job #3129656) | Cod sursa (job #627518)
Cod sursa(job #627518)
#include<cstdio>
#include<vector>
using namespace std;
int n, m, s;
vector <int>L[100001];
bool viz[100001];
int nivel[100001];
void BFS(int s)
{
int pr, ul, st[100001];
unsigned int i;
pr = ul = 0;
st[ul] = s;
nivel[s] = 0;
viz[s] = true;
while(pr <= ul)
{
s = st[pr++];
for(i = 0; i < L[s].size(); i++)
{
int x = L[s][i];
if(!viz[x])
{
st[++ul] = x;
viz[x] = true;
nivel[x] = nivel[s] + 1;
}
}
}
}
int main()
{
int i, x, y;
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);
L[x].push_back(y);
}
BFS(s);
for(i = 1; i <= n; i++)
{
if(nivel[i] == 0 && i != s) nivel[i] = -1;
printf("%d ", nivel[i]);
}
return 0;
}