hdu 3371 Connect the Cities

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=3371
最小生成树，这道题卡时间g++过了，c++ tle了/(ㄒoㄒ)/~~。。

#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
using std::map;
using std::min;
using std::sort;
using std::pair;
using std::vector;
using std::multimap;
using std::priority_queue;
#define pb(e) push_back(e)
#define sz(c) (int)(c).size()
#define mp(a, b) make_pair(a, b)
#define all(c) (c).begin(), (c).end()
#define iter(c) decltype((c).begin())
#define cls(arr, val) memset(arr, val, sizeof(arr))
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define tr(c, i) for(iter(c) i = (c).begin(); i != (c).end(); ++i)
const int N = 510;
const int INF = 0x3f3f3f3f;
struct edge {
    int u, v, w;
    inline bool operator<(const edge &x) const {
        return w < x.w;
    }
}G[(N * N) << 1];
struct Kruskal {
    int E, par[N], rank[N];
    inline void init(int n) {
        E = 0;
        rep(i, n + 2) {
             par[i] = i;
             rank[i] = 0;
        }
    }
    inline int find(int x) {
        while(x != par[x]) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    inline bool unite(int x, int y) {
        x = find(x), y = find(y);
        if(x == y) return false;
        if(rank[x] < rank[y]) {
            par[x] = y;
        } else {
            par[y] = x;
            rank[x] += rank[x] == rank[y];
        }
        return true;
    }
    inline void built(int m, int k) {
        int u, v, w, q, fa;
        while(m--) {
            scanf("%d %d %d", &u, &v, &w);
            G[E++] = { u, v, w };
        }
        while(k--) {
            scanf("%d", &q);
            scanf("%d %d", &u, &v);
            G[E++] = { u, v, 0 };
            fa = v;
            rep(i, q - 2) {
                scanf("%d", &v);
                G[E++] = { fa, v, 0 };
                fa = v;
            }
        }
    }
    inline int kruskal(int n) {
        int ans = 0, cnt = 0;
        sort(G, G + E);
        rep(i, E) {
            int u = G[i].u, v = G[i].v;
            if(unite(u, v)) {
                ans += G[i].w;
                if(++cnt >= n - 1) return ans;
            }
        }
        return -1;
    }
    inline void solve(int n, int m, int k) {
        init(n), built(m, k);
        printf("%d\n", kruskal(n));
    }
}go;
int main() {
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w+", stdout);
#endif
    int n, m, k, T;
    scanf("%d", &T);
    while(T--) {
        scanf("%d %d %d", &n, &m, &k);
        go.solve(n, m, k);
    }
    return 0;
}