从刘汝佳的紫书上看到的这道题,没看懂他的神奇的解法什么意思,干脆直接暴力枚举子集,因为这相当于是一道稠密图的题,用kruskal不太划算,直接上Prim,250ms解决虽然比别的提交者慢了很多,但是解决这道题也足够了。
因为最多只有8个subnetwork,可以直接枚举他们的每种组合(这里用了bitset枚举),至多2^8=256种,在可接受的范围内。本题以坐标的形式给出了城市间的关系,因此边的数量较多。先用origin_dis[maxn][maxn]数组记录边权,以免枚举子集时重复计算,这样,在枚举子集时只需要先将origin_dis数组复制到dis数组,然后将所有选中集合中的边置为0即可,每次枚举选中集合的权值之和和prim的结果相加就是总花费,找到最小的一个即可。
代码如下
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<climits>
#define maxn 1005
#define inf 0x3f3f3f3f
#define sqr(x) (x)*(x)
using namespace std;
typedef long long ll;
int xy[maxn][2], n, q, origin_dis[maxn][maxn],subw[8],dis[maxn][maxn],closedge[maxn];
bool vis[maxn];
vector<int> subnet[8];
ll prim()
{
ll ret = 0;
int newv,mincost;
memset(vis + 1, 0, sizeof(bool)*n);
for (int i = 2; i <= n; i++) closedge[i] = dis[i][1];
vis[1] = true;
for (int i = 2; i <= n; i ++ )
{
mincost = inf;
for(int j=2;j<=n;j++)
if (!vis[j] && closedge[j] < mincost)
{
mincost = closedge[j];
newv = j;
}
vis[newv] = true;
ret += mincost;
for (int j = 2; j <= n; j++)
if (!vis[j] && dis[newv][j] < closedge[j])
closedge[j] = dis[newv][j];
}
return ret;
}
ll solve()
{
ll ans = LLONG_MAX, tans;
for (int bitset = 0; bitset < (1 << q); bitset++)
{
tans = 0;
for (int i = 1; i <= n; i++) memcpy(dis[i] + 1, origin_dis[i] + 1, sizeof(int)*n);
for (int i = 0; i < q; i++)
if (bitset&(1 << i))
{
tans += subw[i];
for (int j = 0; j < subnet[i].size(); j++)
for (int k = j+1; k < subnet[i].size(); k++)
dis[subnet[i][k]][subnet[i][j]]=dis[subnet[i][j]][subnet[i][k]] = 0;
}
tans += prim();
ans = min(ans, tans);
}
return ans;
}
int main()
{
int T;
scanf("%d", &T);
while(T--)
{
scanf("%d%d", &n, &q);
for (int i = 0, k,t;i < q; i++)
{
subnet[i].clear();
scanf("%d%d", &k, &subw[i]);
for (int j = 0; j < k; j++)
{
scanf("%d", &t);
subnet[i].push_back(t);
}
}
for (int i = 1; i <= n; i++)
scanf("%d%d", &xy[i][0], &xy[i][1]);
for (int i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++)
origin_dis[i][j] = origin_dis[j][i] = sqr(xy[i][0] - xy[j][0]) + sqr(xy[i][1] - xy[j][1]);
printf("%d\n", solve());
if (T) putchar('\n');
}
return 0;
}