Cod sursa(job #1808306)
| Utilizator | Data | 17 noiembrie 2016 16:40:55 | |
|---|---|---|---|
| Problema | BFS - Parcurgere in latime | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
void df(int,int);
vector<int> v[100010];
int n,m,s,i,x,y,sol[100010];
int main()
{
f>>n>>m>>s;
for(i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
}
for(i=1;i<=n;i++)
sol[i]=n+1;
df(s,0);
for(i=1;i<=n;i++)
if(sol[i]==n+1)
g<<-1<<' ';
else
g<<sol[i]<<' ';
return 0;
}
void df(int s,int s1)
{
sol[s]=s1;
for(auto it:v[s])
if(sol[it]>s1+1)
df(it,s1+1);
}
