Cod sursa(job #1505258)
Utilizator | Data | 18 octombrie 2015 22:14:45 | |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
#include<vector>
using namespace std;
vector<int>b[100001];
int n,c[100001],viz[100001];
ifstream fin("bfs.in");
ofstream fout("bfs.out");
void bfs(int s)
{
int z,w,i,u,p;
c[1]=s;
viz[s]=1;
p=u=1;
while(p<=u)
{
z=c[p];p++;
for(i=0;i<b[z].size();i++)
{
w=b[z][i];
if(!viz[w])
{
u++;
c[u]=w;
viz[w]=viz[z]+1;
}
}
}
}
int main()
{
int s,m,i,x,y;
fin>>n>>m>>s;
for(i=1;i<=m;i++)
{
fin>>x>>y;
b[x].push_back(y);
}
bfs(s);
for(i=1;i<=n;i++)
fout<<viz[i]-1<<' ';
return 0;
}