[Kruskal] UVA1151

题意

给你点的坐标, 还有一堆已经连好有固定花费的集合, 求花费最小的生成树

思路

集合只有8个, 枚举所有加入和不加入的可能性
TLE, 用到并查集的路径压缩(好像有的代码不用也可以)
注意细节
还有什么传说中的UVA的输出格式
(小声)一天就能做一道题…..

代码

#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;
typedef long long ll;

const int INF = 0x7f7f7f7f;
const int maxn = 1000 + 10;
const int maxm = maxn * maxn;

int n, m, q;
struct point {
    int x, y;
} pt[ maxn ];

struct Edge {
    int u, v;
    int dis;
    bool operator< ( const Edge &rhs ) const { return dis < rhs.dis; }
} edge[ maxm ];

struct st {
    int x, w;
    int node[ maxn ];
} st[ 10 ];

//路径压缩,否则TLE
int fa[ maxn ];
int findset ( int x ) {
    int r = x;
    while ( r != fa[ r ] )
        r = fa[ r ];

    int i = x, j;
    while ( fa[ i ] != r ) {
        j = fa[ i ];
        fa[ i ] = r;
        i = j;
    }
    return r;
}
void merg ( int u, int v ) { fa[ findset ( u ) ] = findset ( v ); }

int kruskal () {
    int sum = 0, cnt = 0;

    //失去一部分店之后终止条件cnt >= n-1没有用了
    for ( int i = 0; i < m; ++i ) {
        int u = edge[ i ].u, v = edge[ i ].v;
        if ( findset ( u ) != findset ( v ) ) {
            sum += edge[ i ].dis;
            merg ( u, v );
        }
    }
    return sum;
}

void Init () {
    scanf ( "%d%d", &n, &q );
    m = 0; //注意初始化
    for ( int i = 0; i < q; ++i ) {
        scanf ( "%d%d", &st[ i ].x, &st[ i ].w );
        for ( int j = 0; j < st[ i ].x; ++j )
            scanf ( "%d", &st[ i ].node[ j ] );
    }
    //输入点,从1开始输入
    for ( int i = 1; i <= n; ++i )
        scanf ( "%d%d", &pt[ i ].x, &pt[ i ].y );
    //每一条边都加入进来
    for ( int i = 1; i <= n; ++i )
        for ( int j = i + 1; j <= n; ++j ) {
            edge[ m ].u = i, edge[ m ].v = j;
            int d = ( pt[ i ].x - pt[ j ].x ) * ( pt[ i ].x - pt[ j ].x ) +
                    ( pt[ i ].y - pt[ j ].y ) * ( pt[ i ].y - pt[ j ].y );
            edge[ m++ ].dis = d;
        }
}

void solve () {
    int ans = INF;
    sort ( edge, edge + m );

    //二进制枚举,枚举所有set加入还是不加入
    for ( int i = 0; i < ( 1 << q ); ++i ) {
        int cost = 0;
        //每次枚举都要初始化并查集
        for ( int i = 1; i <= n; ++i )
            fa[ i ] = i;
        //判断第j个set是否加入进来
        for ( int j = 0; j < q; ++j ) {
            if ( ( i >> j ) & 1 ) {
                //更新cost和并查集
                cost += st[ j ].w;

                for ( int k = 1; k < st[ j ].x; ++k )
                    merg ( st[ j ].node[ k ], st[ j ].node[ 0 ] );
            }
        }
        //设定好已经加入的边和点之后剩下的正常MST
        int sol = kruskal ();
        ans = min ( ans, sol + cost );
    }
    printf ( "%d\n", ans );
}

int main () {
#ifdef LOCAL
    freopen ( "in", "r", stdin );
#endif

    int t;
    scanf ( "%d", &t );
    for ( int ks = 0; ks < t; ++ks ) {
        if ( ks )
            printf ( "\n" );//输出格式
        Init ();
        solve ();
    }
    return 0;
}