Pagini recente » Cod sursa (job #2317434) | Cod sursa (job #734462) | Cod sursa (job #1348168) | Cod sursa (job #387809) | Cod sursa (job #1629783)
#include <fstream>
#include<bitset>
#include<queue>
#define NMAX 100005
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector<int> a[NMAX];
int rez[NMAX];
bitset<NMAX> viz;
queue <int> q;
int N,M,S;
void bf(int x)
{
int nod;
q.push(x);
while(!q.empty())
{
nod=q.front();
q.pop();
for(int i=0;i<a[nod].size();++i)
if(viz[a[nod][i]]==0)
{
viz[a[nod][i]]=1;
q.push(a[nod][i]);
rez[a[nod][i]]=rez[nod]+1;
}
}
}
int main()
{
int x,y;
f>>N>>M>>S;
for(int i=1;i<=M;++i)
{
f>>x>>y;
a[x].push_back(y);
//a[y].push_back(x);
}
rez[S]=1;
viz[S]=1;
bf(S);
for(int i=1;i<=N;++i)
g<<rez[i]-1<<" ";
return 0;
}