Submission #69153706

---

Source Code Expand

#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <assert.h>
#include <random>
#include <chrono>
#include <ctime>
#include <queue>
#include <functional>
using namespace std;

#define ll long long
const int N = (int)5000 + 5;
const ll oo = (ll)1e18 + 5;
int W[N];
vector<int> g[N];
ll dp[N][N];

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define rand(a, b) uniform_int_distribution<ll>(a, b)(rng)

/*
dp[i] = min cost to reach 1 from i
dp[1] = 0
dp[i][t] = W_i * t + min(dp[j][t+1], j adj to i)
dp[i][0] is what we want!
(i, t) -> (j, t + 1) edge has weight W_i * t
(1, .) is a dead-end with cost 0
Run DFS on this graph starting from 
*/
typedef array<int, 2> vtx;

void solve() {
    int n, m;
    cin >> n >> m;
    for (int i=1;i<=n;++i) {
        g[i].clear();
    }
    for (int i=1;i<=n;++i) cin >> W[i];
    for (int i=2;i<=n;++i) {
        for (int j=0;j<=n;++j) {
            dp[i][j] = oo;
        }
    }
    for (int j=0;j<=n;++j) dp[1][j] = W[1] * 1LL * j;
    for (int i=0;i<m;++i) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for (int t=n-1;t>=0;--t) {
        for (int u=2;u<=n;++u) {
            for (auto v : g[u]) {
                dp[u][t] = min(dp[v][t + 1] + W[u] * 1LL * t, dp[u][t]);
            }
        }
    }
    for (int i=1;i<=n;++i) cout << dp[i][0] << '\n';
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}

Submission Info

Judge Result