Pagini recente » Clasament test1241 | Cod sursa (job #2780455) | Cod sursa (job #268774) | Cod sursa (job #1459778) | Cod sursa (job #2705488)
#include <fstream>
#include <vector>
#define NMAX 100001
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,i,m,x,y,s;
vector<int> G[NMAX];
int dist[NMAX],viz[NMAX];
void bfs(int x)
{
int i,pi,ps,Q[NMAX];
pi=ps=0;
viz[x]=1;
dist[x]=0;
Q[pi]=x;
while(pi<=ps)
{
x=Q[pi++];
for (i=0;i<G[x].size();i++)
if (!viz[G[x][i]])
{
viz[G[x][i]]=1;
dist[G[x][i]]=dist[x]+1;
Q[++ps]=G[x][i];
}
}
}
int main()
{
f>>n>>m>>s;
for(i=1;i<=m;i++)
{
f>>x>>y;
G[x].push_back(y);
}
for(i=1;i<=n;i++)
dist[i]=-1;
bfs(s);
for (i=1;i<=n;i++)
g<<dist[i]<<' ';
f.close();
g.close();
return 0;
}