HDOJ 3790 双权值Dijkstra

 #include <iostream>
 #include <stdio.h>
 #include <string.h>
 #include <cstring>
 using namespace std;

 const int INF = ;
 const int MAXSIZE = ;

 int map[MAXSIZE][MAXSIZE];
 int price[MAXSIZE][MAXSIZE];
 int n;

 void Dijkstra(int s,int e){
     bool done[MAXSIZE];
     int dis[MAXSIZE],co[MAXSIZE];

     memset(done,,sizeof(done));

     for(int i = ;i <= n;i++)
         dis[i] = INF;
     dis[s] = co[s] = ;

     for(int i = ;i <= n;i++){//最多执行n+1次操作
         int pos,minn = INF;
         for(int j = ;j <= n;j++){//先找到d[]最小的点
             if(!done[j] && dis[j] < minn){
                 minn = dis[j];
                 pos = j;
             }
         }
         done[pos] = ;//将该点加入集合
         for(int j = ;j <= n;j++){//再更新所有的d[]
             //if(!done[j] && d[minx] + map[minx][j] < d[j])
                 //d[j] = d[minx] + map[minx][j];

             if (!done[j] && map[pos][j] != INF){
                 //若存在更小的路径，取更小的路径
                 if (dis[j] > dis[pos] + map[pos][j]){
                     dis[j] = map[pos][j] + dis[pos];
                     co[j] = price[pos][j] + co[pos];
                 }
                 //当最短路径相等时候，取价格小的
                 else if (dis[j] == dis[pos] + map[pos][j] && co[j] > co[pos] + price[pos][j])
                     co[j] = co[pos] + price[pos][j];
             }
         }
     }
     printf("%d %d\n",dis[e],co[e]);
 }

 int main(){
     int m,s;
     int i,j;
     int p,q,t,pri;
     int ww,ans;

     while(scanf("%d%d",&n,&m) , n || m){
         ans = ;
         for(i = ;i < MAXSIZE;i++){
             for(j = ;j < MAXSIZE;j++){
                 if(i == j)
                     map[i][j] = ;
                 else
                     map[i][j] = INF;
             }
         }
         while(m--){
             scanf("%d%d%d%d",&p,&q,&t,&pri);
             if(t < map[p][q]){//可能两站间存在多条线路取短的那条路
                 map[p][q] = t;
                 map[q][p] = t;
                 price[p][q] = pri;
                 price[q][p] = pri;
             }
         }
         scanf("%d%d",&ww,&s);
         map[][ww] = ;
         Dijkstra(,s);//巧妙之处，加入超级源点0
     }
     return ;
 }