165 lines
3.2 KiB
C++
165 lines
3.2 KiB
C++
/* Problem URL: https://codeforces.com/problemset/problem/2110/D */
|
|
|
|
#include <bits/stdc++.h>
|
|
#include <ext/pb_ds/assoc_container.hpp>
|
|
#include <ext/pb_ds/tree_policy.hpp>
|
|
|
|
using namespace std;
|
|
using namespace __gnu_pbds;
|
|
|
|
template <class T, class comp = less<>>
|
|
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
|
|
|
|
#define V vector
|
|
|
|
#define rmin(a, b) a = min(a, b)
|
|
#define rmax(a, b) a = max(a, b)
|
|
|
|
#define rep(i, lim) for (int i = 0; i < (lim); i++)
|
|
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
|
|
|
|
#define repv(i, v) for (auto &i : (v))
|
|
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
|
|
#define sortv(v) sort(v.begin(), v.end())
|
|
#define all(v) (v).begin(), (v).end()
|
|
|
|
using vi = vector<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
|
|
for (auto &i : vec) {
|
|
os << i[0];
|
|
for (size_t j = 1; j < i.size(); j++) {
|
|
os << ' ' << i[j];
|
|
}
|
|
os << '\n';
|
|
}
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
const int oo = INT32_MAX >> 1;
|
|
const ll OO = INT64_MAX >> 1;
|
|
|
|
|
|
void pre()
|
|
{
|
|
|
|
}
|
|
|
|
#define TEST 1
|
|
|
|
void solve()
|
|
{
|
|
int n, m;
|
|
cin >> n >> m;
|
|
|
|
vl val(n);
|
|
cin >> val;
|
|
|
|
V<V<pair<int, ll>>> tmp(n);
|
|
while (m--) {
|
|
int a, b, c;
|
|
cin >> a >> b >> c;
|
|
tmp[a - 1].emplace_back(b - 1, c);
|
|
}
|
|
|
|
V<V<pair<int, ll>>> graph(n);
|
|
rep(i, n) {
|
|
if (tmp[i].empty()) {
|
|
continue;
|
|
}
|
|
sortv(tmp[i]);
|
|
graph[i].emplace_back(tmp[i][0]);
|
|
nrep(j, 1, tmp[i].size()) {
|
|
if (tmp[i][j].first == tmp[i][j - 1].first) {
|
|
continue;
|
|
}
|
|
|
|
graph[i].emplace_back(tmp[i][j]);
|
|
}
|
|
}
|
|
|
|
vl dp(n);
|
|
|
|
ll low = 0;
|
|
ll high = 1e18;
|
|
ll ans = -1;
|
|
while (low <= high) {
|
|
ll mid = (high - low) / 2 + low;
|
|
|
|
fill(all(dp), -OO);
|
|
|
|
dp[0] = min(mid, val[0]);
|
|
rep(i, n) {
|
|
repv(j, graph[i]) {
|
|
if (j.second > dp[i]) {
|
|
continue;
|
|
}
|
|
dp[j.first] = max(dp[j.first], min(dp[i] + val[j.first], mid));
|
|
}
|
|
}
|
|
|
|
if (dp[n - 1] >= 0) {
|
|
ans = mid;
|
|
high = mid - 1;
|
|
continue;
|
|
}
|
|
|
|
low = mid + 1;
|
|
}
|
|
|
|
cout << ans << '\n';
|
|
}
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
pre();
|
|
|
|
int t;
|
|
(TEST && cin >> t) || (t = 1);
|
|
while (t--) {
|
|
solve();
|
|
}
|
|
}
|