PTA 7-11（图） 公路村村通（30 分） 最小生成树prim

最小生成树 prim 算法，

注意判非联通

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#include <sstream>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
using namespace std;
typedef long long ll;
const int maxn = 1000 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;
int n, m;
int ans[maxn], vis[maxn];
struct node {
    int v, co;
    node() {}
    node(int v, int d) :v(v), co(d) {}
};
vector<node> a[maxn];


void init() {
    scanf("%d %d", &n, &m);
    int u, v, d;
    for(int i = 0; i < m; ++i) {
        scanf("%d %d %d", &u, &v, &d);
        a[u].push_back(node(v, d));
        a[v].push_back(node(u, d));
    }
}

void solve() {
    memset(ans, INF, sizeof ans);
    memset(vis, 0, sizeof vis);
    for(int i = 0; i < a[1].size(); ++i)
        ans[a[1][i].v] = a[1][i].co;
    ans[1] = 0; vis[1] = 1;
    int anss = 0;
    while(1) {
        int t = -1;
        for(int i = 2; i <= n; ++i) {
            if(!vis[i] && (t == -1 || ans[i] < ans[t])) t = i;
        }
        if(t != -1 && ans[t] == INF) { cout << "-1" << endl; return ; }
        if(t == -1) break;
        vis[t] = 1; anss += ans[t];
        for(int i = 0; i < a[t].size(); ++i)
            if(ans[a[t][i].v] > a[t][i].co) ans[a[t][i].v] = a[t][i].co;
    }
    cout << anss << endl;
}

int main() {
    init();
    solve();
    return 0;
}

/*
6 15
1 2 5
1 3 3
1 4 7
1 5 4
1 6 2
2 3 4
2 4 6
2 5 2
2 6 6
3 4 6
3 5 1
3 6 1
4 5 10
4 6 8
5 6 3
*/