样例可以过，提交爆零WA

#include<bits/stdc++.h>
using namespace std;
int n,m;
vector<int>p[100005];
vector<int>pp[100005];
queue<int>q;
int u[100005];
int uu[100005];
void solve(int x){
	cout<<x<<' ';
	for(int i=0,sz=p[x].size();i<sz;i++){
		if(!u[p[x][i]]){
			u[p[x][i]]=1;
			solve(p[x][i]);
		}
	}
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		int x,y;
		cin>>x>>y;
		p[x].push_back(y);
		pp[x].push_back(y);
	}
	u[1]=true;
	solve(1);
	cout<<endl;
	uu[1]=true;
	q.push(1);
	while(!q.empty()){
		int x=q.front();
		q.pop();
		cout<<x<<' ';
		for(int i=0,sz=pp[x].size();i<sz;i++){
			if(!uu[pp[x][i]]){
				uu[pp[x][i]]=1;
				q.push(pp[x][i]);
			}
		}
	}
	return 0;
}