aoj2249（dijkstra最短路）

/*
translation:
	给出一张图，删去其中一些边，使得满足2个条件。1：费用最小，2：首都1和其他点的最小距离不变
solution:
	最短路，dijkstra
	首先求出最短路径，然后暴力求出答案即可
note:
date:
	2016.10.19
*/
#include <iostream>
#include <cstdio>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#include <algorithm>

using namespace std;
const int maxn = 10000+5;
const int INF = 1e8;
typedef pair<int, int> P;

struct Edge
{
	int from, to, d, cost;
	Edge(int f=0, int t=0, int d=0, int c=0):from(f),to(t),d(d),cost(c){}
};

int n, m, d[maxn];
vector<Edge> G[maxn];

void dijkstra(int s)
{
	priority_queue<P, vector<P>, greater<P> > pq;
	fill(d, d+n+1, INF);
	d[s] = 0;
	pq.push(P(0, s));

	while(!pq.empty())
	{
		P p = pq.top();	pq.pop();
		int v = p.second;
		if(d[v] < p.first)	continue;
		for(int i = 0; i < G[v].size(); i++)
		{
			Edge e = G[v][i];
			if(d[e.to] > d[v] + e.d)
			{
				d[e.to] = d[v] + e.d;
				pq.push(P(d[e.to], e.to));
			}
		}
	}
}

int main()
{
	//freopen("in.txt", "r", stdin);
	while(~scanf("%d%d", &n, &m))
	{
		if(!n && !m)	break;
		for(int i = 0; i <= n; i++)	G[i].clear();

		int u, v, dis, c;
		for(int i = 0; i < m; i++)
		{
			scanf("%d%d%d%d", &u, &v, &dis, &c);
			G[u].push_back(Edge(u, v, dis, c));
			G[v].push_back(Edge(v, u, dis, c));
		}

		dijkstra(1);

		int ans = 0;
		for(int i = 2; i <= n; i++)
		{
			int tmp = INF;
			for(int j = 0; j < G[i].size(); j++)
				if(d[G[i][j].to] + G[i][j].d == d[i])
					tmp = min(tmp, G[i][j].cost);
			ans += tmp;
		}
		printf("%d\n", ans);

	}
    return 0;
}