#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int map[501][501], dis[501], value[501], maxval[501];
bool book[501];
int n, m, start, end, a, b, len;
void dij(){
for(int i = 0; i < n; i++){
dis[i] = map[start][i];
}
dis[start] = 0;
maxval[start] = value[start];
for(int i = 0; i < n; i++){
int min = 999999;
int u = start;
for(int j = 0; j < n; j++){
if(!book[j] && dis[j] < min){
min = dis[j];
u = j;
}
}
book[u] = true;
for(int j = 0; j < n; j++){
if(dis[j] > dis[u] + map[u][j]){
dis[j] = dis[u] + map[u][j];
maxval[j] = maxval[u] + value[j];
}
if(dis[j] == dis[u] + map[u][j]){
maxval[j] = maxval[j] > (maxval[u] + value[j]) ? maxval[j] : (maxval[u] + value[j]);
}
}
}
}
int main(){
memset(book, 0, sizeof(book));
cin >> n >> m >> start >> end;
for(int i = 0; i < n; i++){
cin >> value[i];
}
memset(map, 999999, sizeof(map));
for(int i = 0; i < m; i++){
cin >> a >> b >> len;
map[a][b] = len;
map[b][a] = len;
}
dij();
cout << dis[end] << " " << maxval[end] << endl;
return 0;
}
51nod1459 dijkstra
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.