提出 #70489761

---

ソースコード 拡げる

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

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));
}

using namespace std;

using ll = long long;

constexpr ll INF = 1e18;

void solve() {
    int N, M;
    cin >> N >> M;
    vector<int> W(N);
    for (int i = 0; i < N; i++) {
        cin >> W[i];
    }
    vector<vector<int>> G(N);
    for (; M--;) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }

    vector dp(N, vector<ll>(N, INF));
    for (int i = 0; i < N; i++) {
        dp[i][0] = 0;
    }
    for (int i = N - 1; i > 0; i--) {
        for (int j = 0; j < N; j++) {
            for (int k : G[j]) {
                chmin(dp[i - 1][k], dp[i][j] + 1LL * W[j] * i);
            }
        }
    }

    for (int i = 0; i < N; i++) {
        cout << dp[0][i] << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    solve();
    return 0;
}

提出情報

ジャッジ結果