(Uva)Buy or Build(B)

どこでもドア:
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3592

#include<iostream>
#include<fstream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<sstream>
#include<cctype>
#include<set>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include <iterator>
#include <utility> //std::pair
using namespace std;
#define M 1010
int n,m,edge_sum;
int p[M],l[M*M],ve[8][M], val[2][10];
struct Edge{
    int x,y;
    int val;
    bool operator < (const Edge &p) const {
        return val< p.val;
    }
}edge[M*M/2];
int Dis(pair<int,int> a,pair<int,int> b){
    return ((a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second));
}
int Find(int x){
    return x == p[x] ? x : p[x] = Find(p[x]);
}
int MST1(){//最小生成树
    int ans = 0;
    l[0] = 0;
    for(int i = 0; i < edge_sum; ++i){
        int x = Find(edge[i].x);
        int y = Find(edge[i].y);
        if(x != y){
            ans += edge[i].val;
            p[x] = y;
            l[++l[0]] = i;//保存最小生成树作为初始的MST，其中l[0]记录边的个数
            if(l[0]==n-1) return ans;
        }
    }
}
int MST2(){//带优惠的最小生成树
    int ans = 0;
    //遍历初始MST保存的边来提高时间效率
    for(int i = 1; i <= l[0]; ++i){
        int x = Find(edge[l[i]].x);
        int y = Find(edge[l[i]].y);
        if(x != y){
            p[x] = y;
            ans += edge[l[i]].val;
        }
    }
    return ans;
}

int main(){

    int T;
    cin >> T;
    while(T--){
        scanf("%d %d", &n, &m);
        vector<pair<int,int> > ma;
        ma.clear();
        // 记录子树
        for(int i = 0; i < m; ++i){
            scanf("%d %d", &val[0][i], &val[1][i]);
            for(int j = 0; j < val[0][i]; ++j)
                scanf("%d", &ve[i][j]);
        }
        //记录坐标并计算相互之间的距离
        int x,y;
        edge_sum=0;
        for(int i=0;i<n;i++)
        {
            scanf("%d%d",&x,&y);
            ma.push_back(make_pair(x,y));

            for(int j=0;j<i;j++){
                edge[edge_sum].val=Dis(ma[i],ma[j]);
                edge[edge_sum].x=i+1;
                edge[edge_sum].y=j+1;
                edge_sum++;
            }
        }
        //按权值排序
        sort(edge,edge+edge_sum);

        for(int i = 0; i <= n; ++i)    p[i] = i;
        int ans = MST1();//无优惠的最小费用，初始最小生成树

        for(int i = 0; i < (1<<m); i++){//二进制法枚举
            int cost = 0;
            for(int j = 0; j <= n; j++) //初始化p集合
                p[j] = j;

            for(int j = 0; j < m; j++){
                if(i&(1<<j)){
                    cost += val[1][j];
                    for(int k = 0; k < val[0][j]-1; ++k){
                        int g = Find(ve[j][k]);
                        int h = Find(ve[j][k+1]);
                        if(g != h)   p[g] = h;
                    }
                }
            }
            ans = min(ans, cost + MST2());//更新最小值
        }

        printf("%d\n", ans);
        if(T)  printf("\n");
    }
    return 0;
}