【HDU3371】Connect the Cities（MST基础题）

注意输入的数据分别是做什么的就好。还有，以下代码用C++交可以过，而且是500+ms，但是用g++就会TLE，很奇怪。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <algorithm>
#include <numeric>
#include <limits.h>

#define typec int
using namespace std;

const typec inf = 0xffff;
const int V = 505;
int vis[V]; typec lowc[V];
int Map[V][V];

typec prim (typec cost[][V], int n) {
    int i, j, p;
    typec minc, res = 0;
    memset(vis, 0, sizeof(vis));
    vis[0] = 1;
    for (i = 1; i < n; ++ i) lowc[i] = cost[0][i];
    for (i = 1; i < n; ++ i) {
        minc = inf;
        p = -1;
        for (j = 0; j < n; ++ j) {
            if (0 == vis[j] && minc > lowc[j]) {
                minc = lowc[j];
                p = j;
            }
        }
        if (inf == minc) return -1;
        res += minc;
        vis[p] = 1;
        for (j = 0; j < n; ++ j) {
            if (0 == vis[j] && lowc[j] > cost[p][j]) {
                lowc[j] = cost[p][j];
            }
        }
    }
    return res;
}


int main () {
    int n, road_n, union_n, T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d%d", &n, &road_n, &union_n);
        //cout << "road_n : "  << road_n << endl;
        for (int i = 0; i < V; ++ i) {
            for (int j = 0; j < V; ++ j) {
                if (i == j) Map[i][j] = 0;
                else Map[i][j] = inf;
            }
        }

        for (int i = 0; i < road_n; ++ i) {
            int x, y, w;
            scanf("%d%d%d", &x, &y, &w);
            Map[x - 1][y - 1] = Map[y - 1][x - 1] = min(Map[x - 1][y - 1], w);

        }
        /*
        for (int i = 0 ; i < n; ++ i) {
            for (int j = 0; j < n; ++ j) {
                cout << Map[i][j] << "	";
            }
            cout << endl;
        }
        */
        for (int i = 0; i < union_n; ++ i) {
            int xx, xx_n, last;
            scanf("%d", &xx_n);
            for (int j = 0; j < xx_n; ++ j) {
                scanf("%d", &xx);
                if (!j) {
                    last = xx;
                    continue;
                } else {
                    Map[xx - 1][last - 1] = Map[last - 1][xx - 1] = 0;
                    last = xx;
                }
            }
        }

        printf("%d
", prim(Map, n));
    }
    return 0;
}