[算法]PAT-A_1030_双邻接矩阵Dijkstra

//这道题是最短路径问题的练手题，边权除了距离之外还加上了费用
//只需要开两个分别代表距离和费用的邻接矩阵即可
//采用的方法1，Dijkstra
//尝试一下
#include<iostream>
#include<stdlib.h>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<vector>
using namespace std;

const int maxv = 510;
const int INF = 100000000;
int pre[maxv];
int n, m, st, ed;
int G[maxv][maxv];
int cost[maxv][maxv];
int d[maxv], c[maxv];
bool vis[maxv] = {false};

void Dijkstra(int st){
    fill(d, d+maxv, INF);
    fill(c, c+maxv, INF);
    d[st] = 0;
    c[st] = 0;
    for(int i=0;i<n;i++){
        int u = -1, min_dis = INF;
        for(int j=0;j<n;j++){
            if(vis[j]==false && d[j]<min_dis){
                //这里忘记判断vis[j]==false啦
                //肯定是在剩下的还没有确定下真值的点中找最小值
                min_dis = d[j];
                u = j;
            }
        }
        if(u==-1) return;
        vis[u] = true;
        for(int v=0;v<n;v++){
            if(vis[v]==false && G[u][v]!=INF){
                if(d[u]+G[u][v]<d[v]){
                    d[v] = d[u] + G[u][v];
                    c[v] = c[u] + cost[u][v];
                    pre[v] = u;
                }
                else if(d[u]+G[u][v]==d[v]){
                    if(c[u]+cost[u][v]<c[v]){
                        c[v] = c[u] + cost[u][v];
                        pre[v] = u;
                    }
                }
            }
        }
    }
}

void DFS(int v){
    if(v==st){//
        printf("%d ", v);
        return;
    }
    DFS(pre[v]);
    printf("%d ", v);
}

int main(){
    fill(G[0], G[0]+maxv*maxv, INF);
    scanf("%d%d%d%d", &n, &m, &st, &ed);
    int begin_, end_;
    for(int i=0;i<m;i++){
        scanf("%d%d", &begin_, &end_);
        scanf("%d", &G[begin_][end_]);
        scanf("%d", &cost[begin_][end_]);
        G[end_][begin_] = G[begin_][end_];
        cost[end_][begin_] = cost[begin_][end_];
    }
    Dijkstra(st);
    DFS(ed);
    printf("%d %d\n", d[ed], c[ed]);
    return 0;
}