WA0 (都是WA On line 1)

#include<bits/stdc++.h>
#define reg register
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
vector<int>edge[1000005],ans;
int n,m,x,y;
bool vis[1000005];
queue<int>q;
void DFS(reg int now)
{
	vis[now]=1;
	ans.push_back(now);
	for(reg int i=0;i<edge[now].size();i++)
	{
		if(!vis[edge[now][i]])
		DFS(edge[now][i]);
	}
}
void BFS()
{
	q.push(1);
	vis[1]=1;
	while(!q.empty())
	{
		reg int now=q.front();
		ans.push_back(now);
		for(reg int i=0;i<edge[now].size();i++)
		{
			if(!vis[edge[now][i]])
			{
				q.push(edge[now][i]);
				vis[edge[now][i]]=1;
			}
		}
		q.pop();
	}
}
int main()
{
	scanf("%d%d",&n,&m);
	for(reg int i=1;i<=m;i++)
	{
		scanf("%d%d",&x,&y);
		edge[x].push_back(y);
	}
	for(reg int i=1;i<=n;i++)sort(edge[x].begin(),edge[x].end());
	memset(vis,0,sizeof vis);
	ans.clear();
	DFS(1);
	for(reg int i=0;i<ans.size();i++)printf("%d ",ans[i]);
	puts("");
	memset(vis,0,sizeof vis);
	ans.clear();
	BFS();
	for(reg int i=0;i<ans.size();i++)printf("%d ",ans[i]);
	return 0;
}

还是太菜了......