Buy or Build 【UVA - 1151】【二进制枚举+Kruskal】

题目链接

---

  很套路的一道题了。

  题意：有N个点，P个套餐，选择套餐的话，我们提供Cnt个点，Cost的花费，可以让套餐中的所有的点全部链接上去。其他的点，链接两个点的价值为。

  因为P很小，所以直接二进制枚举来做。生成树用Kruskal来，比较的方便。

  注意PE。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
#define Min3(a, b, c) min(a, min(b, c))
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 1e3 + 7;
int N, P, _UP, root[maxN], cnt[10], cost[10];
int fid(int x) { return x == root[x] ? x : root[x] = fid(root[x]); }
vector<int> vt[10];
struct node
{
    ll x, y;
    node(ll a=0., ll b=0.):x(a), y(b) {}
    inline void in() { scanf("%lld%lld", &x, &y); }
}a[maxN];
double _dis(int i, int j) { return (a[i].x - a[j].x) * (a[i].x - a[j].x) + (a[i].y - a[j].y) * (a[i].y - a[j].y); }
struct Eddge
{
    int u, v; ll len;
    Eddge(int a=0, int b=0, ll c=0):u(a), v(b), len(c) {}
    friend bool operator < (Eddge e1, Eddge e2) { return e1.len < e2.len; }
}edge[maxN * maxN];
int line;
inline ll solve(int state)
{
    for(int i=1; i<=N; i++) root[i] = i;
    ll sum = 0;
    for(int i=0, len, now = 0, nex; i<P; i++)
    {
        if((state >> i) & 1)
        {
            sum += cost[i];
            len = cnt[i];
            if(len) now = fid(vt[i][0]);
            for(int j=1; j<len; j++)
            {
                nex = fid(vt[i][j]);
                if(now == nex) continue;
                root[nex] = now;
            }
        }
    }
    for(int i=1, u, v; i<=line; i++)
    {
        u = fid(edge[i].u); v =fid(edge[i].v);
        if(u != v)
        {
            root[u] = v;
            sum += edge[i].len;
        }
    }
    return sum;
}
inline void init()
{
    line = 0;
    for(int i=1; i<=N; i++) root[i] = i;
    for(int i=0; i<P; i++) vt[i].clear();
    _UP = (1 << P) - 1;
}
int main()
{
    int T; scanf("%d", &T);
    while(T --)
    {
        scanf("%d%d", &N, &P);
        init();
        for(int i=0; i<P; i++)
        {
            scanf("%d%d", &cnt[i], &cost[i]);
            for(int j=1, pot; j<=cnt[i]; j++)
            {
                scanf("%d", &pot);
                vt[i].push_back(pot);
            }
        }
        for(int i=1; i<=N; i++) a[i].in();
        for(int i=1; i<=N; i++)
        {
            for(int j=i+1; j<=N; j++)
            {
                edge[++line] = Eddge(i, j, _dis(i, j));
            }
        }
        sort(edge + 1, edge + line + 1);
        ll ans = solve(0);
        for(int i=1; i<=_UP; i++)
        {
            ans = min(ans, solve(i));
        }
        printf("%lld\n", ans);
        if(T) puts("");
    }
    return 0;
}