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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
| #include <iostream>
#include <algorithm>
#include <queue>
#define MAXN 100100
#define MAXM 200100
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
struct Edge;
struct Node
{
Edge *edge;
long long high, dist;
bool flag;
Node()
{
high = 0;
flag = false;
dist = INF;
edge = NULL;
}
}node[2*MAXN];
struct Edge
{
Node *from, *to;
long long val;
Edge *next;
Edge(Node *from = NULL, Node *to = NULL, long long val = 0)
:from(from), to(to), val(val), next(from? from->edge: NULL) {}
};
long long n, m, k;
deque<Node*> q;
long long SPFA(Node *s, Node *t)
{
s->dist = 0;
s->flag = true;
q.push_back(s);
while (!q.empty())
{
Node *tmp = q.front();
q.pop_front();
for (Edge *e = tmp->edge; e; e = e->next)
{
if (tmp->dist + e->val < e->to->dist)
{
e->to->dist = tmp->dist + e->val;
if (!e->to->flag)
{
e->to->flag = true;
if ( (!q.empty()) && e->to->dist < q.front()->dist)
q.push_front(e->to);
else q.push_back(e->to);
}
}
}
tmp->flag = false;
}
return t->dist;
}
long long getlonglong()
{
long long x = 0;
char c = getchar();
while (c<'0' || c>'9')
c = getchar();
while (c<='9' && c>='0')
x = x * 10 + c - '0', c = getchar();
return x;
}
int main()
{
cin >> n >> m >> k;
for (long long i = 1; i<=n; i++)
{
node[i].high = getlonglong();
node[n+i].high = - node[i].high;
}
for (long long i = 1; i<=m; i++)
{
long long x, y, z;
x = getlonglong();
y = getlonglong();
z = getlonglong();
node[n+x].edge = new Edge(&node[n+x], &node[y], z);
node[n+y].edge = new Edge(&node[n+y], &node[x], z);
}
k += node[1].high;
for (long long i = 1; i<=n; i++)
{
long long x = max(node[i].high - k, 0LL);
node[i].edge = new Edge(&node[i], &node[n+i], x*x);
}
long long ans = SPFA(&node[1], &node[2*n]);
cout << ans << endl;
}
|