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
| #include <iostream>
#include <cstdio>
#include <queue>
#include <climits>
#define INF LLONG_MAX
using namespace std;
const int N = 1e4 + 10, M = 1e5 + 10;
long long n, m, b, fee[N], dis[N];
bool vis[N];
long long idx, hd[N], nxt[M], edg[M], wt[M];
bool spfa (long long maxn)
{
for (int i = 1; i <= n; i++)
dis[i] = INF;
dis[1] = 0;
queue <int> q;
vis[1] = true;
q.push(1);
while (!q.empty())
{
int t = q.front();
q.pop();
vis[t] = false;
for (int i = hd[t]; i; i = nxt[i])
if (fee[edg[i]] <= maxn && dis[t] + wt[i] < dis[edg[i]])
{
dis[edg[i]] = dis[t] + wt[i];
if (!vis[edg[i]])
{
q.push(edg[i]);
vis[edg[i]] = true;
}
}
}
if (dis[n] > b)
return false;
return true;
}
void add (int x, int y, int z)
{
nxt[++idx] = hd[x];
hd[x] = idx;
edg[idx] = y;
wt[idx] = z;
}
int main ()
{
long long l = 0, r = 0, mid;
cin >> n >> m >> b;
for (int i = 1; i <= n; i++)
{
cin >> fee[i];
r = max(r, fee[i]);
}
l = max(fee[1], fee[n]);
for (long long i = 1, u, v, w; i <= m; i++)
{
cin >> u >> v >> w;
if (u == v)
continue;
add(u, v, w);
add(v, u, w);
}
if (!spfa(r))
{
cout << "AFK";
return 0;
}
while (l <= r)
{
mid = l + r >> 1;
if (spfa(mid))
r = mid - 1;
else
l = mid + 1;
}
cout << l;
return 0;
}
|