hdu 3790 最短路spfa模板

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#define clr(x, k) memset((x), (k), sizeof(x))
#define MAXe 1000002 //e;
#define MAXn 1210
#define INF 1<<30
using namespace std;
struct Edge
{
	int to, w, p, next;
}e[MAXe<<1];
int head[MAXn], dist[MAXn], inq[MAXn], cost[MAXn];
int n, m, T, st, en;
queue<int> q;

void add_e(int u, int v, int w, int p)
{
	e[T].to = v;
	e[T].w = w;
	e[T].p = p;
	e[T].next = head[u];
	head[u] = T++;
	return ;
}

void spfa(int st)
{
	for (int i=1;i<=n;i++)
	{
		cost[i] = dist[i] = (i==st)?0:INF;
		
	}
	clr(inq,0);
	q.push(st);
	while (!q.empty())
	{
		int u = q.front(); q.pop();
		inq[u] = 0;
		for (int i=head[u];i!=-1;i=e[i].next)
		{
			int v = e[i].to;
			if (dist[v] >= dist[u] + e[i].w)
			{
        if ((dist[v] > dist[u] + e[i].w)
				|| (dist[v] == dist[u] + e[i].w)
				&& (cost[v] > cost[u] + e[i].p))
        {
					cost[v] = cost[u] + e[i].p;
				}
				dist[v] = dist[u] + e[i].w;
				if (!inq[v])
				{
					q.push(v);
					inq[v] = 1;
				}
			}
		}
	}
}
int main()
{
		while (~scanf("%d %d", &n, &m), n||m)
		{
			clr(head,-1);
			int u, v, w, p;
			T = 0;
			for (int i=0;i<m;i++)
			{
				scanf("%d %d %d %d", &u, &v, &w, &p);
				add_e(u,v,w,p);
				add_e(v,u,w,p);
			}
			scanf("%d %d", &st, &en);
			spfa(st);
			printf("%d %d\n", dist[en], cost[en]);
		}
		return 0;
}