原题 0pts，代码豆包说没问题

#include <bits/stdc++.h>
using namespace std;
int n,m;
bool vis[100005];
vector <int> nmap[100005];
queue <int> q;
void dfs(int x)
{
	vis[x] = 1;
	cout << x << " ";
	for (int i = 0;i < nmap[x].size();i++)
	{
		if (!vis[nmap[x][i]])
		{
			dfs(nmap[x][i]);	
		}
	}
	return ;
}
int main()
{
	cin >> n >> m;
	for (int i = 0;i < m;i++)
	{
		int x,y;
		cin >> x >> y;
		nmap[x].push_back(y);
	}
	memset (vis,0,sizeof(vis));
	dfs(1);
	memset(vis,0,sizeof(vis));
	cout << endl;
	vis[1] = 1;
	q.push(1);
	while (!q.empty())
	{
		int x = q.front();
		q.pop();
		cout << x << " ";
		for (int i = 0;i < nmap[x].size();i++)
		{
			if (!vis[nmap[x][i]])
			{
				q.push(nmap[x][i]);
				vis[nmap[x][i]] = 1;
			}
		}
	}
	return 0;
}