Pagini recente » Cod sursa (job #155337) | Cod sursa (job #819768) | Cod sursa (job #1694642) | Cod sursa (job #742793) | Cod sursa (job #2483239)
#include <bits/stdc++.h> //JuniorMonster a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
using namespace std;
ll n,m,s,x,y,ans[100005];
vector<ll>v[100005];
int32_t main(){
CODE_START;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
cin>>n>>m>>s;
for(ll i=0;i<m;i++)
{
cin>>x>>y;
v[x].pb(y);
}
queue<ll>q;
q.push(s);
memset(ans,-1,sizeof(ans));
ans[s]=0;
while(!q.empty()){
x=q.front();
for(ll i=0;i<v[x].size();i++)
if(ans[v[x][i]]==-1){
q.push(v[x][i]);
ans[v[x][i]]=ans[x]+1;
}
q.pop();
}
for(ll i=1;i<=n;i++)
cout<<ans[i]<<' ';
}