AOJ 2249 Road Construction 最短路

题目描述：

Description
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
u1v1d1c1
.
.
.
uMvMdMcM

The first line of each dataset begins with two integers, N and M (1 ≤ N ≤ 10000, 0 ≤ M ≤ 20000). N and M indicate 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 is ci.

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

题目分析：

n个点，m条边，每条边有一个路程和花费。求到1点距离最小（最短路）的前提下，寻找花费最小的值。
单源最短路，想到dijkstra。

• -

代码如下：

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <numeric>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int MAXM = 20010;
const int MAXN = 10010;

int ans[MAXN],dp[MAXN];
int n,m;
struct Edge
{
    int to,cost,dis;
};
vector <Edge> mp[MAXM];
struct qnode
{
    int u,dis;
    bool operator<(const qnode &r) const
    {
        return dis>r.dis;
    }
};

int dijkstra()
{
    int ret = 0;
    priority_queue<qnode> pq;
    memset(dp, 0x3f, sizeof dp);
    memset(ans, 0x3f, sizeof ans);
    pq.push((qnode)
    {
        1, 0
    });
    dp[1] = 0;
    while(!pq.empty())
    {
        qnode p = pq.top();
        pq.pop();
        int u = p.u, d = p.dis;
        if(d > dp[u]) continue;
        for(int i = 0; i < mp[u].size(); ++i)
        {
            Edge &e = mp[u][i];
            if(dp[e.to] > dp[u] + e.dis)
            {
                ans[e.to] = e.cost;
                dp[e.to] = dp[u] + e.dis;
                pq.push((qnode)
                {
                    e.to, dp[e.to]
                });
            }
            else if(dp[e.to] == dp[u] + e.dis && ans[e.to] > e.cost)
                ans[e.to] = e.cost;
        }
    }
    return accumulate(ans + 2, ans + n + 1, ret);
}

int main()
{
    while(~scanf("%d%d",&n,&m) && (n||m))
    {
        for(int i=1; i<=n; i++) mp[i].clear();
        for(int i=1; i<=m; i++)
        {
            int u,v,d,c;
            scanf("%d%d%d%d",&u,&v,&d,&c);
            mp[u].push_back((Edge)
            {
                v,d,c
            });
            mp[v].push_back((Edge)
            {
                u,d,c
            });
        }
        int ans=dijkstra();
        printf("%d\n",ans);
    }
    return 0;
}
//通过优先队列优化或者邻接表建立都可以，看个人喜好和熟练程度，我对这些容器的使用不太熟悉，学习了一发。（其实更多的人用bellman_ford或者其强化版spfa做的，都是相当优秀的单源最短路模板。