1030最简单的2级模板卡了 dfs卡了

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector> 
using namespace std;
const int maxn = 520;
const int inf = 10000000;
int n,m,s,ed; 
int G[maxn][maxn],cost[maxn][maxn];
int d[maxn],c[maxn];
bool vis[maxn] = {false};
int pre[maxn];
void dijkstra(int s)
{
	d[s] = 0;
	c[s] = 0;
	
	for(int i = 0; i < n; i++)
	{
	    int u = -1,min = inf;
		for(int j = 0; j < n; j++)
		{
			if(vis[j] == false && d[j] < min )
			{
				u = j; 
				min = d[j];
			}
		}
		if(u == -1) return ;
		vis[u] = true;
		for(int v = 0; v < n; v++)
		{
			if(vis[v] == false && G[u][v] < inf)
			{
				if(d[u] + G[u][v] < d[v])
				{
					d[v] = d[u] + G[u][v];
					c[v] = c[u] + cost[u][v];
					pre[v] = u;
				}
				else if(d[u] + G[u][v] == d[v] && c[u] + cost[u][v] < c[v])
				{
					c[v] = c[u] + cost[u][v];
					pre[v] = u;
				}
			}
		}
	}
}
void dfs(int v)
{
	if(v == s)
	{
		printf("%d ",v);
		return;
	}
	dfs(pre[v]);
	printf("%d ",v);
} 
int main()
{
	
	int u,v;
	fill(G[0],G[0]+maxn*maxn,inf);
	fill(cost[0],cost[0] + maxn*maxn,inf);
	fill(d,d+maxn,inf);
	fill(c,c+maxn,inf);
	scanf("%d %d %d %d",&n,&m,&s,&ed);
	for(int i = 0; i < m; i++)
	{
		scanf("%d %d",&u,&v);
		scanf("%d %d",&G[u][v],&cost[u][v]);
		G[v][u] = G[u][v];
		cost[v][u] = cost[u][v];
	}
	dijkstra(s);
	dfs(ed);
	printf("%d %d\n",d[ed],c[ed]);
	return 0;
}