Pagini recente » Cod sursa (job #205367) | Cod sursa (job #1661383) | Cod sursa (job #759524) | Cod sursa (job #2489939) | Cod sursa (job #2919886)
#include<bits/stdc++.h>
using namespace std;
string numeFisier="bfs";
ifstream fin(numeFisier+".in"); ofstream fout(numeFisier+".out");
#define cin fin
#define cout fout
#define INIT ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
//#define int ll
int n, m, s;
vector<int> g[100010];
int d[100001];
void bfs(int d[]){
for(int i=1; i<=n; i++){
d[i]=-1;
}
d[s]=0;
queue<int> q;
q.push(s);
while(!q.empty()){
int s=q.front(); q.pop();
for(int u:g[s]){
if(d[u]==(-1)){
d[u]=d[s]+1;
q.push(u);
}
}
}
}
int32_t main(){
INIT
cin>>n>>m>>s;
for(int i=1; i<=m; i++){
int u, v;
cin>>u>>v;
g[u].pb(v);
}
bfs(d);
for(int i=1; i<=n; i++){
cout<<d[i]<<" ";
}
return 0;
}