2018多校第3场 M-Walking Plan && HDU6331 Problem M. Walking Plan

本文链接：https://blog.csdn.net/computer_user/article/details/81316110

本文介绍了一种解决特定图论问题的方法，即在有向图中寻找从起点s到终点t，经过至少k条边的最短路径。通过分块计算策略，将大量边数的问题简化为更小规模的子问题，利用动态规划进行高效求解。代码实现详细展示了如何预处理路径长度，以快速响应多次询问。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接：M- Walking Plan

题意：给定一个 n 个点，m 条边的有向图，q 次询问 s 到 t 经过至少 k 条边的最短路

数据范围：2 ≤ n ≤ 50,1 ≤ m,k ≤ 10000,1 ≤ q ≤ 100000

思路分析：分块计算，k<=10000,把100条边缩成一条边。偷懒把题解放上来吧...

代码如下：

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

typedef long long LL;
LL dis[205][55][55];
LL g[105][55][55];
LL INF;
int n,m,q;

inline LL Min(LL x, LL y) {return x<y?x:y; }

LL get(int s,int t, int k){
    if (k<=100) return dis[k][s][t];
    register int i,q,r;
    register LL ans = INF;

    q = (k-1)/100;
    r = k - 100*q;

    for (i=1; i<=n; ++i) ans = Min(ans,dis[r][s][i] + g[q][i][t]);
    return ans;
}

int main(){
    int T; scanf("%d",&T);
    register int i,j,k,cir;
    while (T--){
        memset(g,0x2f,sizeof(g));
        memset(dis,0x2f,sizeof(dis));
        INF = dis[0][0][0];
        scanf("%d%d",&n,&m);

        int x,y,z; LL w;
        for (i=1; i<=m; ++i) {
            scanf("%d%d%lld",&x,&y,&w);
            dis[1][x][y] = Min(dis[1][x][y],w);
        }

        for (cir=2; cir<=200; ++cir) {
            for (k=1; k<=n; ++k) {
                for (i=1; i<=n; ++i) {
                    for (j=1; j<=n; ++j) {
                        dis[cir][i][j] = Min(dis[cir-1][i][k] + dis[1][k][j],dis[cir][i][j]);
                    }
                }
            }
        }

        for (i=1; i<=n; ++i) {
            for (int j=1; j<=n; ++j) g[1][i][j] = dis[100][i][j];
        }

        for (cir=199; cir>0; --cir) {
                for (i=1; i<=n; ++i) {
                    for (j=1; j<=n; ++j) {
                        dis[cir][i][j] = Min(dis[cir+1][i][j],dis[cir][i][j]);
                    }
                }
        }

        for (cir=2; cir<=100; ++cir) {
            for (k=1; k<=n; ++k) {
                for (i=1; i<=n; ++i) {
                    for (j=1; j<=n; ++j) {
                        g[cir][i][j] = Min(g[cir-1][i][k] + g[1][k][j],g[cir][i][j]);
                    }
                }
            }
        }

        scanf("%d",&q);
        LL ans;
        for (i=1; i<=q; ++i) {
            scanf("%d%d%d",&x,&y,&z);
            ans = get(x,y,z);
            if (ans == INF) puts("-1"); else printf("%lld\n",ans);
        }
    }
    return 0;
}