AOJ 2249 Road Construction（双权值最短路）

Road Construction

King Mercer is the king of ACM kingdom. There are one capital and some cities in his kingdom. Amazingly, there are no roads in the kingdom now. Recently, he planned to construct roads between the capital and the cities, but it turned out that the construction cost of his plan is much higher than expected.

In order to reduce the cost, he has decided to create a new construction plan by removing some roads from the original plan. However, he believes that a new plan should satisfy the following conditions:

• For every pair of cities, there is a route (a set of roads) connecting them.
• The minimum distance between the capital and each city does not change from his original plan.

Many plans may meet the conditions above, but King Mercer wants to know the plan with minimum cost. Your task is to write a program which reads his original plan and calculates the cost of a new plan with the minimum cost.

Input

The input consists of several datasets. Each dataset is formatted as follows.

N M
u1 v1 d1 c1 
.
.
.
uM vM dM cM 

The first line of each dataset begins with two integers, N and M (1 ≤ N ≤ 10000, 0 ≤ M ≤ 20000). N and Mindicate the number of cities and the number of roads in the original plan, respectively.

The following M lines describe the road information in the original plan. The i-th line contains four integers,ui, vi, di and ci (1 ≤ ui, vi ≤ N , ui ≠ vi , 1 ≤ di ≤ 1000, 1 ≤ ci ≤ 1000). ui , vi, di and ci indicate that there is a road which connects ui-th city and vi-th city, whose length is di and whose cost needed for construction isci.

Each road is bidirectional. No two roads connect the same pair of cities. The 1-st city is the capital in the kingdom.

The end of the input is indicated by a line containing two zeros separated by a space. You should not process the line as a dataset.

Output

For each dataset, print the minimum cost of a plan which satisfies the conditions in a line.

Sample Input

3 3
1 2 1 2
2 3 2 1
3 1 3 2
5 5
1 2 2 2
2 3 1 1
1 4 1 1
4 5 1 1
5 3 1 1
5 10
1 2 32 10
1 3 43 43
1 4 12 52
1 5 84 23
2 3 58 42
2 4 86 99
2 5 57 83
3 4 11 32
3 5 75 21
4 5 23 43
5 10
1 2 1 53
1 3 1 65
1 4 1 24
1 5 1 76
2 3 1 19
2 4 1 46
2 5 1 25
3 4 1 13
3 5 1 65
4 5 1 34
0 0

Output for the Sample Input

3
5
137
218

题目大意：给出一个无向图，1号点为首都，在点1到各点最短距离不变的情况下，求连通所有点需要的最小花费。

解题思路：当d[e.to] > d[u] + e.dis时更新d[e.to]和c[e.to]，当d[e.to] == d[u] + e.dis && c[e.to] > e.cost时更新c[e.to]，注意要将c[e.to]更新为e.cost而不是c[u] + e.cost。

代码如下：

#include <bits/stdc++.h>
#define INF 1e9 + 5
using namespace std;
const int maxn = 10005;
int d[maxn],c[maxn];
struct edge
{
	int to,dis,cost;
	edge(int to,int dis,int cost){
		this -> to = to;
		this -> dis = dis;
		this -> cost = cost;
	}
	edge(){}
};
struct node
{
	int dis,cost,v;
	node(int dis,int cost,int v){
		this -> dis = dis;
		this -> cost = cost;
		this -> v = v;
	}
	node(){}
	bool operator < (const node& a)const{
		if(dis == a.dis) return cost > a.cost;
		return dis > a.dis;
	}
};

vector<edge> G[maxn];
priority_queue<node> que;
int n,m;
void init()
{
	for(int i = 0;i <= n;i++)
		G[i].clear();
}

void add_edge(int from,int to,int dis,int cost)
{
	G[from].push_back(edge(to,dis,cost));
	G[to].push_back(edge(from,dis,cost));
}

void dijkstra(int s)
{
	while(que.size()) que.pop();
	for(int i = 1;i <= n;i++) d[i] = INF,c[i] = INF;
	d[s] = c[s] = 0;
	que.push(node(0,0,s));
	while(que.size()){
		node nd = que.top();
		que.pop();
		int u = nd.v;
		if(d[u] < nd.dis) continue;
		for(int i = 0;i < (int)G[u].size();i++){
			edge e = G[u][i];
			if(d[e.to] > d[u] + e.dis){
				d[e.to] = d[u] + e.dis;
				c[e.to] = e.cost;
				que.push(node(d[e.to],c[e.to],e.to));
			}
			if(d[e.to] == d[u] + e.dis){
				if(c[e.to] > e.cost){
					c[e.to] = e.cost;
					que.push(node(d[e.to],c[e.to],e.to));
				}
			}
		}
	}
	return ;
}

int main(int argc, char const *argv[])
{
	int a,b,x,y;
	while(scanf("%d %d",&n,&m) != EOF && (n || m)){
		init();
		for(int i = 0;i < m;i++){
			scanf("%d %d %d %d",&a,&b,&x,&y);
			add_edge(a,b,x,y);
		}
		dijkstra(1);
		long long ans = 0;
		for(int i = 1;i <= n;i++)
			ans += c[i];
		printf("%lld\n",ans);
	}
	return 0;
}