Pagini recente » Cod sursa (job #3256797) | Cod sursa (job #2739723) | Cod sursa (job #1026096) | Cod sursa (job #63581) | Cod sursa (job #3002461)
#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
FILE*in=fopen("bfs.in","r");
FILE*out=fopen("bfs.out","w");
const int NMAX=100007;
vector<int> adj[NMAX];
int n,m,s,i,j,x,y,a;
queue<int> q;
bool b[NMAX];
int d[NMAX];
void bfs()
{
while(!q.empty())
{
a=q.front();
q.pop();
for(auto t:adj[a])
{
if(b[t]==0)
{
d[t]=d[a]+1;
b[t]=1;
q.push(t);
}
}
}
}
int main()
{
fscanf(in,"%d%d%d",&n,&m,&s);
q.push(s);
b[s]=1;
memset(d,-1,sizeof(d));
d[s]=0;
for(i=1;i<=m;i++)
{
fscanf(in,"%d%d",&x,&y);
adj[x].push_back(y);
}
bfs();
for(i=1;i<=n;i++)
{
fprintf(out,"%d ",d[i]);
}
}