Cod sursa(job #1292977)
| Utilizator | Data | 15 decembrie 2014 08:18:46 | |
|---|---|---|---|
| Problema | BFS - Parcurgere in latime | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
int n, m, s, viz[100003], q[100003];
vector <int> v[100003];
int main()
{
in>>n>>m>>s;
for(int x,y, i=1; i<=m; ++i)
in>>x>>y, v[x].push_back(y);
q[1]=s;
viz[s]=1;
int p=1,u=1;
while(p<=u)
{ int i=q[p];
int sf=v[i].size();
for(int j=0;j<sf;++j)
if(!viz[v[i][j]])
{ viz[v[i][j]]=viz[i]+1;
q[++u]=v[i][j];
}
p++;
}
for (int i=1;i<=n;i++) out<<viz[i]-1<<' ';
out.close();
return 0;
}
