【BZOJ2324】[ZJOI2011]营救皮卡丘 给定起点最小权K链可相交覆盖

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int JQK;int n, m, k, dis[][];
int main() {
        int u, v, c;
        scanf("%d %d %d", &n, &m, &k);
        memset(dis, , sizeof(dis));
        for (int i = ; i <= m; i++) {
                scanf("%d %d %d", &u, &v, &c);
                dis[u][v] = dis[v][u] = min(dis[u][v], c);
        }
        for (int k = ; k <= n; k++) {
                for (int i = ; i <= n; i++) {
                        for (int j = ; j <= n; j++) {
                                if (k <= i || k <= j)
                                        dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
                        }
                }
        }
        int s, t;
        s =  * (n + ) + , t = s + ;
        MCMF::MAXP = t + ;
        MCMF::init(s, t);
        MCMF::addedge(s, , k, );
        for (int i = ; i <= n; i++) {
                MCMF::addedge(s, i, , );
                MCMF::addedge(i + n, t, , );
        }
        for (int i = ; i <= n; i++) {
                for (int j = i + ; j <= n; j++) {
                        MCMF::addedge(i, j + n, , dis[i][j]);
                }
        }
        cout << MCMF::mcmf();
        return ;
}