bfs 0pts求助

#include<bits/stdc++.h>
#define ll long long
#define AKIOI ios::sync_with_stdio(false);cin.tie(0),cout.tie(0)
#define AKNOI return 0
#define db double
#define int register int
#define endl '\n'
using namespace std;
ll n,m,maxn[100005];
vector<ll>p[100005];
bool vis[100005];
void bfs(ll x){
	queue<ll>q;
	q.push(x);
	while(!q.empty()){
		ll now=q.front();
		q.pop();
		for(auto it:p[now]){
			if(!vis[it]){
				vis[it]=1;
				/*maxn[it]=*/maxn[now]=maxn[x]=max(maxn[x],it);
				q.push(it);
			}
		}
	}
}
signed main(){
	AKIOI;
	ll n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++) maxn[i]=i;
	for(int i=1;i<=m;i++){
		ll u,v;
		cin>>u>>v;
		p[u].push_back(v);
	}
	bfs(1);
	for(int i=1;i<=n;i++) cout<<maxn[i]<<' ';
	AKNOI;
}