51Nod 1459 迷宫游戏

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;
const int maxn = 500 + 10;
const int INF = 0x3f3f3f3f;
int pic[maxn][maxn];    //用来存图
int dis[maxn];
int val[maxn], ans[maxn];//ans数组用来记录所走路径经过房间的权值和
bool vis[maxn];
int n, m, sta, en;

void dij(){
    for (int i = 0; i<n; i++)
        dis[i] = pic[sta][i];
    dis[sta] = 0;
    ans[sta] = val[sta];
    for (int i = 0; i<n; i++){
        int min = INF;
        int u = sta;
        for (int j = 0; j < n; j++){
            if (!vis[j] && dis[j] < min){
                u = j;
                min = dis[j];
            }
        }
        vis[u] = 1;
        for (int j = 0; j<n; j++){
            if (dis[j]>dis[u] + pic[u][j]){
                dis[j] = dis[u] + pic[u][j];
                ans[j] = ans[u] + val[j];
            }
            else if (dis[j] == dis[u] + pic[u][j]){
                ans[j] = max(ans[j], ans[u] + val[j]);//若路径花费相等，点权值取较大的。
            }
        }
    }
}

int main(){
    ios::sync_with_stdio(false);

    memset(pic, INF, sizeof(pic));
    memset(ans, 0, sizeof(ans));
    memset(vis, 0, sizeof(vis));

    cin >> n >> m >> sta >> en;
    for (int i = 0; i<n; i++)
        cin >> val[i];
    for (int i = 0; i<m; i++){
        int a, b, len;
        cin >> a >> b >> len;
        pic[a][b] = pic[b][a] = len;
    }
    dij();
    cout << dis[en] << ' ' << ans[en] << endl;
    
    return 0;
}