Pagini recente » Cod sursa (job #383219) | Cod sursa (job #1435205) | Cod sursa (job #1925594) | Cod sursa (job #2471033) | Cod sursa (job #2776153)
#include<fstream>
#include<vector>
using namespace std;
ifstream F("bfs.in");
ofstream G("bfs.out");
#define N 100001
vector<int> a[N];
int s[N],c[N],n,m,l=1,o,i,j,k;
int main()
{
F>>n>>m>>o;
for(i=1;i<=n;++i)
c[i]=-1;
while(m--)
F>>i>>j,a[i].push_back(j);
for(c[o]=0,s[l]=o,i=1;i<=l;++i)
for(k=a[s[i]].size(),j=0;j<k;++j)
if(c[a[s[i]][j]]==-1)
s[++l]=a[s[i]][j],c[s[l]]=c[s[i]]+1;
for(i=1;i<=n;++i)
G<<c[i]<<" ";
return 0;
}