2019icpc 南昌邀请赛 A. Attack (斯坦纳树)

题面链接

思路：斯坦纳树模板。处理出以i为根节点，集合j中的点全联通的最小代价。
然后由于要4对相互连通，。。。就相当于选不超过4个子树来凑成合法方案。
显然又是另一个状压dp。。

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 55;
#define fi first
#define se second
#define pb push_back
#define wzh(x) cerr<<#x<<'='<<x<<endl;
int n, m, cnt;
map<string, int>vi;
vector<pair<int, int>>v[N];
vector<pair<int, int> >f[6];
int a[N], dp[N][1 << 8];
int vis[N];
priority_queue<pair<LL, int> >Q;
void dij(int i) {
	memset(vis, 0, sizeof vis);
	while (!Q.empty()) {
		auto x = Q.top();
		Q.pop();
		if (vis[x.se])continue;
		vis[x.se] = 1;
		for (auto kr : v[x.se]) {
			if (dp[kr.fi][i] > dp[x.se][i] + kr.se) {
				dp[kr.fi][i] = dp[x.se][i] + kr.se;
				Q.push({ -dp[kr.fi][i], kr.fi});
			}
		}
	}
}
int k = 8;
int mx;
void solve() {
	memset(dp, 0x3f3f3f, sizeof dp);
	mx = dp[0][0];
	for (int i = 1; i <= n; i++)dp[i][0] = 0;
	for (int i = 1; i <= 8; i++) {
		string now;
		cin >> now;
		a[i] = vi[now];
		dp[a[i]][1 << i - 1] = 0;
	}
	for (int i = 1; i < 1 << k; i++) {
		for (int j = 1; j <= n; j++) {
			for (int kr = i & (i - 1); kr; kr = i & (kr - 1)) {
				dp[j][i] = min(dp[j][kr] + dp[j][i ^ kr], dp[j][i]);
			}
			if (dp[j][i] < mx)Q.push({ -dp[j][i], j});
		}
		dij(i);
	}
}
int pd[555];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		string now;
		cin >> now;
		vi[now] = ++cnt;
	}
	for (int i = 1; i <= m; i++) {
		string a, b; int c;
		cin >> a >> b >> c;
		v[vi[a]].emplace_back(vi[b], c);
		v[vi[b]].emplace_back(vi[a], c);
	}
	solve();
	int ans = 1e9;
	for (int i = 0; i < 1 << 8; i++)pd[i] = 1e9;
	for (int d = 1; d <= n; d++)
		for (int i = 0; i < 1 << 8; i++) {
			int st = 0;
			for (int j = 0; j < 4; j++) {
				int x = 2 * j, y = 2 * j + 1;
				if (1 << x & i  ) {
					if (1 << y & i) {
						st |= 1 << j;
					}
				}
			}
			pd[st] = min(pd[st], dp[d][i]);
		}
	for (int i = 1; i < 1 << 4; i++) {
		for (int k = i; k; k = i & (k - 1)) {
			pd[i] = min(pd[i], pd[k] + pd[i ^ k]);
		}
	}
	cout << pd[15];
	return 0;
}