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 = ;
 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=; i<=N; i++){
          dis[i] = INF;
          cost[i] = INF;
     }
     dis[src] = ;
     cost[src] = ;
     memset(v, , sizeof(v));
     for (int i=; i<=N; i++) {
         int mark = -, mindis = INF;
         for (int j=; j<=N; ++j) {
             if (!v[j] && dis[j]<mindis) {
                 mindis = dis[j];
                 mark = j;
             }
         }
         v[mark] = ;
         for (int j=; 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, , sizeof(dis));
         memset(cost, , sizeof(cost));
         memset(costEdge, 0x3f, sizeof(costEdge));

         for (int i=; 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 = ;
         scanf("%d %d", &src, &final);
         dijkstra();
         printf("%d %d\n", dis[final], cost[final]);
     }
     return ;
 }