Pagini recente » Cod sursa (job #344366) | Cod sursa (job #1926655) | Cod sursa (job #2610151) | Cod sursa (job #2595789) | Cod sursa (job #1192419)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int viz[100001],c[100001],p,u,i,n,m,a,b,x;
vector<int>v[100001];
int main()
{
f>>n>>m>>x;
for(i=1;i<=m;i++)
{
f>>a>>b;
v[a].push_back(b);
}
p=u=1;
c[p]=x;viz[x]=1;
while(p<=u)
{
for(i=0;i<v[c[p]].size();i++)
if(viz[v[c[p]][i]]==0)
{
c[++u]=v[c[p]][i];
viz[v[c[p]][i]]=viz[c[p]]+1;
}
p++;
}
for(i=1;i<=n;i++)
if(x!=i && viz[i]==0)
g<<-1<<" ";
else
g<<viz[i]-1<<" ";
return 0;
}