Cod sursa(job #1234914)
Utilizator | Data | 28 septembrie 2014 12:39:24 | |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 2.24 kb |
#include <cstdio>
#include <vector>
using namespace std;
vector <int> g[100001];
int sol[100001], n, m, sursa, nr=1;
bool ok[100001];
void bfs (int x, int pas)
{
int i;
if (nr==n) return;
else
{
//while (!g[x].empty())
int sz=g[x].size();
for (i=0; i<sz; i++)
{
if (ok[g[x][i]]==true)
{
if (pas+1<sol[g[x][i]])
{
sol[g[x][i]]=pas+1;
bfs(g[x][i],pas+1);
}
}
else
{
sol[g[x][i]]=pas+1;
ok[g[x][i]]=true;
nr++;
bfs(g[x][i],pas+1);
}
}
}
}
int main()
{
int x, y, i;
freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
scanf("%d%d%d",&n,&m,&sursa);
for (i=1; i<=m; i++)
{
scanf("%d%d",&x,&y);
if (x!=y)
{
g[x].push_back(y);
}
}
sol[sursa]=0;
ok[sursa]=true;
int sz=g[sursa].size();
//while (!g[sursa].empty())
for (i=0; i<sz; i++)
{
//sol[g[sursa].back()]=1;
sol[g[sursa][i]]=1;
//ok[g[sursa].back()]=true;
ok[g[sursa][i]]=true;
nr++;
//bfs(g[sursa].back(),1);
bfs(g[sursa][i],1);
//g[sursa].pop_back();
}
for (i=1; i<=n; i++)
{
if (ok[i]==false)
{
printf("-1 ");
}
else
{
printf("%d ",sol[i]);
}
}
fclose(stdin);
fclose(stdout);
return 0;
}