CF Round#816 E

最新推荐文章于 2026-06-28 21:56:34 发布

原创最新推荐文章于 2026-06-28 21:56:34 发布 · 251 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#图论 #动态规划

图论同时被 2 个专栏收录

6 篇文章

订阅专栏

动态规划

4 篇文章

订阅专栏

本文讲述了作者通过反思做题思路，从Dijkstra算法到利用斜率优化解决航线上最短路径问题的过程，揭示了从第k=1次迭代开始考虑航线更新的重要性，并分享了如何通过凸壳技巧和二分查找优化策略。文章突出了知识点应用和解题策略的转变。

在这里插入图片描述
我大概是应该反省一下我的做题思路了。
$k = 0$ ，直接一发 $d ijk s t r a$ 结束
$k = 1$ ，做一发 $d ijk s t r a$ ，然后考虑用航线来进行更新。推一下式子发现就是个斜率优化，根据第一轮 $d ijk s t r a$ 的结果来维护一个凸壳，每次二分查找最优值进行更新就行。最后再跑一遍最短路完事儿。
$\ge 2$ 的情况类似。
关于为什么没能在考场上做出来：我根本没意识到这就是个斜率优化,还在推数学性质呢…只能说知识点不熟吧（悲

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int MAXN = 1e5 + 5;
const int inf = 0x3f3f3f3f3f3f3f3f;

int N, M, K;
int dis[MAXN];
vector<int> G[MAXN], W[MAXN];

struct node {
    int u, dis;
    node(int a = 0, int b = 0) {
        u = a;
        dis = b;
    }
    friend bool operator<(node a, node b) {
        return a.dis > b.dis;
    }
};

void dijkstra() {
    static bool vis[MAXN];
    priority_queue<node> Q;
    memset(vis, 0, sizeof(vis));
    for (int i = 1; i <= N; i++)
        Q.push(node(i, dis[i]));
    while (Q.size()) {
        int u = Q.top().u;
        Q.pop();
        if (vis[u]) continue;
        vis[u] = true;
        for (int i = 0; i < G[u].size(); i++) {
            int v = G[u][i];
            int w = W[u][i];
            if (dis[v] > dis[u] + w) {
                dis[v] = dis[u] + w;
                Q.push(node(v, dis[v]));
            }
        }
    }
}

double slope(int i, int j) {
    return 1.0 * ((dis[j] + j * j) - (dis[i] + i * i)) / (j - i);
}

void convex_hull_trick() {
    vector<int> convex;
    static int tmp[MAXN];
    for (int i = 1; i <= N; i++) {
        while (convex.size() >= 2 &&
               slope(i, *convex.rbegin()) <
                   slope(*(convex.rbegin() + 1), *convex.rbegin()))
            convex.pop_back();
        convex.push_back(i);
    }
    for (int i = 1; i <= N; i++) {
        int l = 0, r = convex.size() - 1, j;
        while (l <= r) {
            int m = (l + r) >> 1;
            double lslope = (m == 0 ? -inf : slope(convex[m - 1], convex[m]));
            // int rslope = (m + 1 == convex.size() ? -inf : slope(convex[m],
            //                                                  convex[m + 1]));
            if (lslope <= 2 * i) {
                j = convex[m];
                l = m + 1;
            } else
                r = m - 1;
        }
        tmp[i] = min(dis[i], dis[j] + (j - i) * (j - i));
    }
    for (int i = 1; i <= N; i++)
        dis[i] = tmp[i];
}

signed main() {
    freopen("in.txt", "r", stdin);
    ios::sync_with_stdio(false);
    cin >> N >> M >> K;
    for (int i = 1; i <= N; i++)
        dis[i] = inf;
    dis[1] = 0;
    for (int i = 1, u, v, w; i <= M; i++) {
        cin >> u >> v >> w;
        G[u].push_back(v);
        G[v].push_back(u);
        W[u].push_back(w);
        W[v].push_back(w);
    }
    while (K--) {
        dijkstra();
        convex_hull_trick();
    }
    dijkstra();
    for (int i = 1; i <= N; i++)
        cout << dis[i] << " ";
    return 0;
}