发电站(Power Stations) 题解

思路分析

按题目要求使用对应数据结构与算法模拟/递推求解，注意数据范围边界与时间复杂度。

参考代码

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int tid, n;
    if (!(cin >> tid >> n)) return 0;
    vector<long long> x(n), y(n), c(n), k(n);
    for (int i = 0; i < n; ++i) cin >> x[i] >> y[i];
    for (int i = 0; i < n; ++i) cin >> c[i];
    for (int i = 0; i < n; ++i) cin >> k[i];
    vector<long long> dist(c.begin(), c.end());
    vector<int> vis(n, 0);
    long long ans = 0;
    for (int step = 0; step < n; ++step) {
        int u = -1;
        for (int i = 0; i < n; ++i) {
            if (!vis[i] && (u == -1 || dist[i] < dist[u])) u = i;
        }
        vis[u] = 1;
        ans += dist[u];
        for (int v = 0; v < n; ++v) {
            if (!vis[v]) {
                long long d = llabs(x[u] - x[v]) + llabs(y[u] - y[v]);
                long long w = (k[u] + k[v]) * d;
                if (w < dist[v]) dist[v] = w;
            }
        }
    }
    cout << ans << "\n";
    return 0;
}