Pagini recente » Cod sursa (job #1117227) | Cod sursa (job #1078273) | Cod sursa (job #2700600) | Cod sursa (job #1332310) | Cod sursa (job #1740609)
#include <iostream>
#include <fstream>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
int viz[100001],c[100001],d[100001],m,n,p;
int *a[1000001];
void bfs(int x)
{
int prim,ultim,i;
prim=ultim=1;
viz[x]=1;
c[1]=x;
while(prim<=ultim)
{
x=c[prim];
for(i=1;i<=a[x][0];i++)
{
if(viz[a[x][i]]==0)
{
ultim++;
c[ultim]=a[x][i];
d[a[x][i]]=d[x]+1;
viz[a[x][i]]=1;
}
}
prim++;
}
}
int main()
{
int i,x,y;
ifstream f("bfs.in");
ofstream g("bfs.out");
f>>n>>m>>p;
for(i=1;i<=n;i++)
{
a[i]=(int *)realloc(a[i],sizeof(int));
a[i][0]=0;
}
for(i=1;i<=m;i++)
{
f>>x>>y;
if(x!=y)
{
a[x][0]++;
a[x]=(int *)realloc(a[x],(a[x][0]+1)*sizeof(int));
a[x][a[x][0]]=y;
}
}
bfs(p);
for(i=1;i<=n;i++)
{
if(i==p)
{
g<<0<<" ";
}
else
{
if(d[i]==0)
{
g<<-1<<" ";
}
else
{
g<<d[i]<<" ";
}
}
}
return 0;
}