求帮助 wa了2个点 求大佬帮忙看一下哪里错了QAQ

#include<bits/stdc++.h>
using namespace std;
const int INF=2147483647;
struct node
{
	int to,next;
	int dis;
}e[1000101];
int head[2000111],dis[2001101],n,m,num,q[2101001],f[1001][1001]={0};
void add(int from,int to,int dis)
{
	e[++num].to=to;
	e[num].dis=dis;
	e[num].next=head[from];
	head[from]=num;
}
long long sum[10010001];
bool vis[10010101]={0};
void spfa(int st)
{
	for(int i=1;i<=n;i++) dis[i]=INF,sum[i]=1;
	dis[st]=0;vis[st]=1;q[1]=st;
	int h=0,t=1;
	while(h<t)
	{
		int tn=q[++h]; 
		vis[tn]=0;
		int te=head[tn]; 
		for(int i=te;i;i=e[i].next)
		{
			int tmp=e[i].to;
			if(dis[tmp]>dis[tn]+e[i].dis)
			{
				dis[tmp]=dis[tn]+e[i].dis;
				sum[tmp]=sum[tn];
				if(!vis[tmp])
				{
					vis[tmp]=1;
					q[++t]=tmp;
				}
			}
			else
			if(dis[tmp]==dis[tn]+e[i].dis) sum[tmp]+=sum[tn];
		}
		
	}
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		int x,y,z;
		cin>>x>>y>>z;
		if(f[x][y]==0||f[x][y]>z)
		{
			add(x,y,z);
			f[x][y]=z;
		}
	}
	spfa(1);
	if(dis[n]==INF) cout<<"No answer"<<endl;
	else cout<<dis[n]<<' '<<sum[n]<<endl;
	return 0;
}