刷题日记1 蓝桥公园

链接0蓝桥公园 - 蓝桥云课 (lanqiao.cn)

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;

const int N = 410; 
LL d[N][N];

int n, m, q; 

void floyd()
{
    for(int k = 1; k <= n; k ++)
        for(int i = 1; i <= n; i ++)
            for(int j = 1; j <= n; j ++)
                d[i][j] = min(d[i][j],d[i][k] + d[k][j]);
}


int main()
{
    scanf("%d%d%d", &n ,&m, &q);
    
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= n; j ++)
            if(i == j) d[i][j] = 0;
            else d[i][j] = LLONG_MAX / 2;
            
    while(m --)
    {
        LL a, b, c;
        scanf("%lld%lld%lld", &a, &b, &c);
        d[a][b] = d[b][a] =  min(d[a][b], c);
    }
    
    floyd();
    
    while(q --)
    {
        int a, b;
        scanf("%d%d", &a, &b);
        if(d[a][b] >= LLONG_MAX / 2) 
        printf("-1\n");
        else printf("%lld\n", d[a][b]);
    }
    
    return 0;
}

知识点链接多源最短路径算法-Floyd算法（弗洛伊德算法）-CSDN博客