玄关求教，样例过但全WA

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
const int N=1e5+3;
bool vis[N];
vector<int> g[N];
int n,m;
void dfs(int x,int fa){
	cout<<x<<" ";
	for(auto ne:g[x]){
		if(ne==fa||vis[ne]==1) continue;
		vis[ne]=1;

		dfs(ne,x);
	}
}
void bfs(int x){
	queue<int> q;
	q.push(x);
	vis[x]=1;
	
	while(!q.empty()){
	    cout<<q.front()<<" ";
		int fr=q.front();
		for(auto ne:g[fr]){
			if(vis[ne]==1) continue;
			q.push(ne);
		
			vis[ne]=1;
		}
		q.pop();
	}
}
int main(){
	cin>>n>>m;
	for(int i=1,u,v;i<=m;i++){
		cin>>u>>v;
		g[u].push_back(v);
	}
	vis[1]=1;
	dfs(1,0);
	cout<<'\n';
	memset(vis,0,sizeof(vis));
	vis[1]=1;
	bfs(1);
	return 0;
}