uva 3592 (MST, kruskal)

题意：平面上有若干个点，求最小生成树。有最多8个套餐，每个套餐有一个价格和若干个点，一旦购买套餐内的点就会相互连通。

思路：由于套餐不是很多，所以枚举一下即可，然后最小生成树就行了。

代码如下：

/**************************************************
 * Author     : xiaohao Z
 * Blog     : http://www.cnblogs.com/shu-xiaohao/
 * Last modified : 2014-06-23 22:36
 * Filename     : uva_3592.cpp
 * Description     : 
 * ************************************************/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#define MP(a, b) make_pair(a, b)
#define PB(a) push_back(a)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<unsigned int,unsigned int> puu;
typedef pair<int, double> pid;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;

const int INF = 0x3f3f3f3f;
const double eps = 1E-6;
const int LEN = 1010;
int n, m, top, cost[LEN], parent[LEN];
vector<int> Set[LEN];
struct Point{int x, y;}p[LEN];

struct Edge{
    int u, v, val;
    void set(int _u, int _v, int _val){
        u = _u; v = _v; val = _val;
    }
}edge[LEN*LEN];
bool cmp(Edge a, Edge b){return a.val < b.val;}

//UFSet
void UFSet_init(){for(int i=0; i<LEN; i++) parent[i] = i;}
int Find(int x){return parent[x] == x ? x : parent[x] = Find(parent[x]);}
void Union(int a, int b) {int fa = Find(a), fb = Find(b);if(fa!=fb)parent[fa] = fb;}

void init(){
    for(int i=0; i<LEN; i++)
        Set[i].clear();
    top = 0;
}

//kruskal
int kruskal(int x){
    UFSet_init();
    int ret = 0;
    for(int i=0; i<m; i++)if((1<<i) & x){
        ret += cost[i];
        for(int j=1; j<Set[i].size(); j++){
            Union(Set[i][j], Set[i][0]);
        }
    }
    for(int i=0; i<top; i++){
        int a = edge[i].u, b = edge[i].v;
        int val = edge[i].val;
        int pa = Find(a), pb = Find(b);
        if(pa != pb){
            parent[pa] = pb;
            ret += val;
        }
    }
    return ret;
}

int dis(int a, int b){
    return (p[a].x - p[b].x)*(p[a].x - p[b].x) 
            + (p[a].y - p[b].y)*(p[a].y - p[b].y);
}

int main()
{
//    freopen("in.txt", "r", stdin);

    int T, tn, num;
    scanf("%d", &T);
    while(T--){
        scanf("%d%d", &n, &m);
        init();
        for(int i=0; i<m; i++){
            scanf("%d%d", &tn, &cost[i]);
            for(int j=0; j<tn; j++){
                scanf("%d", &num);
                num --;
                Set[i].PB(num);
            }
        }
        for(int i=0; i<n; i++){
            scanf("%d%d", &p[i].x, &p[i].y);
        }
        for(int i=0; i<n; i++){
            for(int j=i+1; j<n; j++){
                edge[top++].set(i, j, dis(i, j));
            }
        }
        int ans = INF;
        sort(edge, edge+top, cmp);
        for(int i=0; i<(1<<m); i++){
            ans = min(ans, kruskal(i));
        }
        printf("%d
", ans);
        if(T != 0) puts("");
    }
    return 0;
}