#982399 (C++23) No.2764 Warp Drive Spacecraft

• 問題: No.2764 Warp Drive Spacecraft
• ユーザー: rniya
• 提出日時: 2024-05-17 22:43:27
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 371 ms / 3,000 ms
• コード長: 3,477 bytes
• コンパイル時間: 3,370 ms
• コンパイル使用メモリ: 265,504 KB
• 実行使用メモリ: 25,936 KB
• 最終ジャッジ日時: 2024-05-18 00:10:52
• 合計ジャッジ時間: 10,622 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,816 KB
testcase_01	AC	2 ms; 6,944 KB
testcase_02	AC	2 ms; 6,944 KB
testcase_03	AC	2 ms; 6,940 KB
testcase_04	AC	2 ms; 6,940 KB
testcase_05	AC	2 ms; 6,944 KB
testcase_06	AC	2 ms; 6,944 KB
testcase_07	AC	2 ms; 6,944 KB
testcase_08	AC	2 ms; 6,940 KB
testcase_09	AC	2 ms; 6,940 KB
testcase_10	AC	2 ms; 6,940 KB
testcase_11	AC	2 ms; 6,944 KB
testcase_12	AC	3 ms; 6,944 KB
testcase_13	AC	3 ms; 6,944 KB
testcase_14	AC	2 ms; 6,940 KB
testcase_15	AC	2 ms; 6,940 KB
testcase_16	AC	115 ms; 21,996 KB
testcase_17	AC	115 ms; 22,024 KB
testcase_18	AC	114 ms; 22,104 KB
testcase_19	AC	268 ms; 20,072 KB
testcase_20	AC	233 ms; 21,212 KB
testcase_21	AC	272 ms; 20,412 KB
testcase_22	AC	266 ms; 21,272 KB
testcase_23	AC	260 ms; 20,076 KB
testcase_24	AC	273 ms; 21,348 KB
testcase_25	AC	271 ms; 21,296 KB
testcase_26	AC	350 ms; 25,104 KB
testcase_27	AC	352 ms; 25,108 KB
testcase_28	AC	352 ms; 25,516 KB
testcase_29	AC	369 ms; 25,580 KB
testcase_30	AC	356 ms; 24,956 KB
testcase_31	AC	371 ms; 25,936 KB
testcase_32	AC	367 ms; 25,924 KB
testcase_33	AC	122 ms; 15,220 KB
testcase_34	AC	124 ms; 15,360 KB
testcase_35	AC	127 ms; 15,228 KB
testcase_36	AC	120 ms; 21,940 KB

ソースコード

#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

struct Line {
    mutable long long k, m, p;
    bool operator<(const Line& o) const { return k < o.k; }
    bool operator<(long long x) const { return p < x; }
};

template <bool isMin = true> struct LineContainer : std::multiset<Line, std::less<>> {
    // (for doubles, use inf = 1/.0, div(a,b) = a/b)
    const long long inf = LLONG_MAX / 2;
    long long div(long long a, long long b) {  // floored division
        return a / b - ((a ^ b) < 0 && a % b);
    }
    bool isect(iterator x, iterator y) {
        if (y == end()) {
            x->p = inf;
            return false;
        }
        if (x->k == y->k)
            x->p = x->m > y->m ? inf : -inf;
        else
            x->p = div(y->m - x->m, x->k - y->k);
        return x->p >= y->p;
    }
    void add(long long k, long long m) {
        if (isMin) k = -k, m = -m;
        auto z = insert({k, m, 0}), y = z++, x = y;
        while (isect(y, z)) z = erase(z);
        if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
        while ((y = x) != begin() && (--x)->p >= y->p) isect(x, erase(y));
    }
    long long query(long long x) {
        assert(!empty());
        auto l = *lower_bound(x);
        long long s = 1;
        if (isMin) s = -1;
        return s * (l.k * x + l.m);
    }
};

using ll = long long;

using namespace std;

constexpr ll INF = 4e18;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    int N, M;
    cin >> N >> M;
    vector<ll> W(N);
    cin >> W;
    vector<vector<pair<int, ll>>> G(N);
    for (; M--;) {
        int U, V;
        ll T;
        cin >> U >> V >> T;
        U--, V--;
        G[U].emplace_back(V, T);
        G[V].emplace_back(U, T);
    }

    auto calc = [&](int s) {
        vector<ll> dp(N, INF);
        priority_queue<pair<ll, int>> pq;
        dp[s] = 0;
        pq.emplace(-dp[s], s);
        while (not pq.empty()) {
            auto [val, v] = pq.top();
            pq.pop();
            val *= -1;
            if (dp[v] != val) continue;
            for (auto [u, cost] : G[v]) {
                if (chmin(dp[u], val + cost)) {
                    pq.emplace(-dp[u], u);
                }
            }
        }
        return dp;
    };

    auto f = calc(0), g = calc(N - 1);
    ll ans = f[N - 1];
    LineContainer lc;
    for (int i = 0; i < N; i++) lc.add(W[i], g[i]);
    for (int i = 0; i < N; i++) chmin(ans, f[i] + lc.query(W[i]));

    cout << ans << '\n';
    return 0;
}