hdu-3790-最短路径问题(Dijkstra)

题目链接

/*
    Name:hdu-3790-最短路径问题
    Copyright:
    Author:
    Date: 2018/4/16 19:16:25
    Description:
    
    dijkstra 模板题
*/
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int MaxN = 1010;
const int INF = 0x3f3f3f3f;
int dis[MaxN], g[MaxN][MaxN],N, src, costEdge[MaxN][MaxN], cost[MaxN];
bool v[MaxN];

void dijkstra() {
    for (int i=1; i<=N; i++){
         dis[i] = INF;
         cost[i] = INF;
    }
    dis[src] = 0;
    cost[src] = 0;
    memset(v, 0, sizeof(v));
    for (int i=1; i<=N; i++) {
        int mark = -1, mindis = INF;
        for (int j=1; j<=N; ++j) {
            if (!v[j] && dis[j]<mindis) {
                mindis = dis[j];
                mark = j;
            }
        }
        v[mark] = 1;
        for (int j=1; j<=N; ++j) {
            if (!v[j]) {
                 if (dis[mark] + g[mark][j] < dis[j]) {
                    dis[j] = dis[mark] + g[mark][j];
                     cost[j] = cost[mark] + costEdge[mark][j];
                 } else if(dis[mark] + g[mark][j] == dis[j] && cost[j] > cost[mark] + costEdge[mark][j]) {
                     cost[j] = cost[mark] + costEdge[mark][j];
                 }
            }
        }
    }
}
int final[MaxN];
int main()
{
//    freopen("in.txt", "r", stdin);
    int m;
    while (~scanf("%d %d", &N, &m) && (N || m)) {
        memset(g, 0x3f, sizeof(g));
        memset(dis, 0, sizeof(dis));
        memset(cost, 0, sizeof(cost));
        memset(costEdge, 0x3f, sizeof(costEdge));

        for (int i=0; i<m; i++) {
            int u, v, w, c;
            scanf("%d %d %d %d", &u, &v, &w, &c);
            if(w < g[u][v]) { //必须判断 重边否则WA 
                g[u][v] = g[v][u] = w;
                costEdge[u][v] = costEdge[v][u] = c;
            }
        }
        int final = 0;
        scanf("%d %d", &src, &final);
        dijkstra();
        printf("%d %d
", dis[final], cost[final]);
    }
    return 0;
}