最小斯坦纳树

#include <cstdio>
#include <algorithm>
#include <queue>

using namespace std;

const int INF = 0x3f3f3f3f;

int n, m, k, start[105], a[15], dp[105][1 << 10];//NOLINT;
struct Edge {
    int to, next, val;
} edge[505 * 2];

struct Queue {
    int pos, val;

    bool operator<(const Queue &tmp) const { return val > tmp.val; }
};

void Dijkstra(int s) {
    priority_queue<Queue> q;
    for (int i = 1; i <= n; i++)if (dp[i][s] != INF)q.push({i, dp[i][s]});
    while (!q.empty()) {
        int p = q.top().pos;
        q.pop();
        for (int i = start[p]; i; i = edge[i].next) {
            if (dp[edge[i].to][s] > dp[p][s] + edge[i].val) {
                dp[edge[i].to][s] = dp[p][s] + edge[i].val;
                q.push({edge[i].to, dp[edge[i].to][s]});
            }
        }
    }
}

signed main() {
//    freopen("in", "r", stdin);
//    freopen("out", "w", stdout);
    scanf("%d %d %d", &n, &m, &k);//NOLINT
    for (int i = 1; i <= m; i++) {
        int u, v, val;
        scanf("%d %d %d", &u, &v, &val);//NOLINT
        edge[2 * i - 1] = {v, start[u], val};
        start[u] = 2 * i - 1;
        edge[2 * i] = {u, start[v], val};
        start[v] = 2 * i;
    }
    for (int i = 1; i <= n; i++)for (int s = 1; s < (1 << k); s++)dp[i][s] = INF;//NOLINT
    for (int i = 1, s = 1; i <= k; i++, s *= 2) {
        scanf("%d", &a[i]);//NOLINT
        dp[a[i]][s] = 0;
    }
    for (int s = 1; s < (1 << k); s++) {//NOLINT
        for (int i = 1; i <= n; i++) {
            for (int sub = s; sub; sub = s & (sub - 1))//NOLINT
                dp[i][s] = min(dp[i][s], dp[i][sub] + dp[i][s - sub]);
        }
        Dijkstra(s);
    }
    int ans = INF;
    for (int i = 1; i <= n; i++)ans = min(ans, dp[i][(1 << k) - 1]);
    printf("%d\n", ans);
    return 0;
}