7-11 公路村村通 (30分)

#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
typedef struct Hamlet
{
    int is_true;
    int parent;
    int pay;
};
Hamlet *citys;
int ** data;
void Init_citys_data(int N)
{
    for(int i = 0; i < N + 2; i++)
    {
        citys[i].is_true = 1;
        citys[i].parent = -1;
        citys[i].pay = INF;
    }
    for(int i = 0; i < N + 2; i++)
    {
        for(int j = 0; j < N + 2; j++)
            data[i][j] = INF;
    }
}
int Prim_Algorithm(int N)
{
    for(int i = 0; i < N; i++)
    {
        int min_pos = N;
        for(int j = 0; j < N; j++)
        {
            if(citys[j].is_true == 1 && citys[j].pay < citys[min_pos].pay)
                min_pos = j;
        }
        citys[min_pos].is_true = 0;
        if(min_pos == N)
            return 0;
        for(int k = 0; k < N; k++)
        {
            if(citys[k].is_true == 1 && data[min_pos][k] < citys[k].pay)
            {
                citys[k].pay = data[min_pos][k];
                citys[k].parent = min_pos;
            }

        }
    }
    return 1;
}
int main()
{
    int N, M, st, en, pay;
    scanf("%d %d", &N, &M);
    citys = new Hamlet[N+5];
    data = new int*[N+5];
    for(int i = 0; i < N + 4; i++)
        data[i] = new int[N+5];
    Init_citys_data(N);
    for(int i = 0; i < M; i++)
    {
        scanf("%d %d %d", &st, &en, &pay);
        st--;
        en--;
        data[st][en] = pay;
        data[en][st] = pay;
    }
    for(int i = 0; i < N; i++)
    {
        citys[i].pay = data[0][i];
    }
    citys[0].pay = 0;
    if(Prim_Algorithm(N))
    {
        int sum = 0;
        for(int i = 0; i < N; i++)
            sum+= citys[i].pay;
        printf("%d", sum);
    }
    else
        printf("-1");
}