https://www.acwing.com/problem/content/531/

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 12, M = 1 << N, INF = 0x3f3f3f3f;

int n, m;
int d[N][N], g[N][M];
int f[M][N];

int main()
{
    scanf("%d%d", &n, &m);

    memset(d, 0x3f, sizeof d);
    for (int i = 0; i < n; i ++ ) d[i][i] = 0;
    while (m -- )
    {
        int a, b, c;
        scanf("%d%d%d", &a, &b, &c);
        a --, b -- ;
        d[a][b] = d[b][a] = min(d[a][b], c);
    }

    memset(g, 0x3f, sizeof g);
    for (int i = 0; i < n; i ++ )
        for (int j = 0; j < 1 << n; j ++ )
            for (int k = 0; k < n; k ++ )
                if (j >> k & 1)
                    g[i][j] = min(g[i][j], d[i][k]);
                    //预处理加速dp转移

    memset(f, 0x3f, sizeof f);
    for (int i = 0; i < n; i ++ ) f[1 << i][0] = 0;//利用题目条件：初始道路免费
    
    
    for (int i = 1; i < 1 << n; i ++ )
        for (int j = i - 1 & i; j; j = j - 1 & i)  // 枚举i的子集
        {
            int r = i ^ j, cost = 0;
            for (int k = 0; k < n; k ++ )
                if (j >> k & 1)
                {
                    cost += g[k][r];
                    if (cost >= INF) break;
                }
            if (cost >= INF) continue;
            for (int k = 1; k < n; k ++ )
                f[i][k] = min(f[i][k], f[r][k - 1] + cost * k);
        }

    int res = INF;
    for (int i = 0; i < n; i ++ )
        res = min(res, f[(1 << n) - 1][i]);
    printf("%d\n", res);

    return 0;
}