1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1LL<<62
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> PP;
struct edge {
int from,to;
ll cost;
edge(int t,int c) : to(t),cost(c) {}
edge(int f,int t,int c) : from(f),to(t),cost(c) {}
bool operator<(const edge &e) const {
return cost < e.cost;
}
};
ll H[100005], Y[100005];
vector<edge> G[100005];
ll d[100005];
void dijkstra(int s, int n, int h) {
priority_queue<PP,vector<PP>,greater<PP> > que;
fill(d,d+n,INF);
d[s] = 0;
Y[s] = h;
que.push(PP(P(0, h), s));
while(que.size()) {
PP p = que.top();
que.pop();
ll cost = p.first.first;
ll cur = p.first.second;
int v = p.second;
if(d[v] < cost) continue;
rep(i,G[v].size()) {
edge e = G[v][i];
if(H[v] < e.cost) continue;
if(cur - e.cost < 0) {
if(e.cost - cur <= H[v] - cur && d[e.to] > d[v] + (e.cost - cur) + e.cost) {
d[e.to] = d[v] + (e.cost - cur) + e.cost;
Y[e.to] = 0;
que.push(PP(P(d[e.to], 0), e.to));
}
} else if(cur - e.cost > H[e.to]) {
if(cur - ((cur - e.cost) - H[e.to]) >= 0 && d[e.to] > d[v] + ((cur - e.cost) - H[e.to]) + e.cost) {
d[e.to] = d[v] + ((cur - e.cost) - H[e.to]) + e.cost;
Y[e.to] = cur - ((cur - e.cost) - H[e.to]) - e.cost;
que.push(PP(P(d[e.to], cur - ((cur - e.cost) - H[e.to]) - e.cost), e.to));
}
} else {
if(d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
Y[e.to] = cur - e.cost;
que.push(PP(P(d[e.to], cur - e.cost), e.to));
}
}
}
}
}
int main() {
int n, m, h;
cin >> n >> m >> h;
memset(H, 0, sizeof(H));
memset(Y, 0, sizeof(Y));
rep(i, n) cin >> H[i];
rep(i, m) {
ll a, b, c;
cin >> a >> b >> c;
a--;
b--;
G[a].push_back(edge(b, c));
G[b].push_back(edge(a, c));
}
dijkstra(0, n, h);
if(d[n-1] == INF) cout << -1 << endl;
else cout << d[n-1] + (H[n-1] - Y[n-1]) << endl;
return 0;
}
|