uva 10600 ACM Contest and Blackout （次小生成树）

uva 10600 ACM Contest and Blackout

题目大意：给你一张图，求最小生成树和次小生成树。

解题思路：次小生成树。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
using namespace std;

typedef long long ll;
const int N = 105;
const int INF = 0x3f3f3f3f;
int n, m;
bool vis[N], used[N][N];
int pre[N], lowc[N];
int Max[N][N];
int cost[N][N];

void init() {
    memset(Max, 0, sizeof(0));
    memset(vis, false, sizeof(vis));    
    memset(used, false, sizeof(used));
    vis[1] = true;
    pre[1] = -1;
    lowc[1] = 0;
    for (int i = 2; i <= n; i++) {
        lowc[i] = cost[1][i];
        pre[i] = 1;
    }
}

void input() {
    memset(cost, INF, sizeof(cost));
    scanf("%d %d", &n, &m);
    int a, b, c;
    for (int i = 0; i < m; i++) {
        scanf("%d %d %d", &a, &b, &c);
        cost[a][b] = cost[b][a] = c;
    }
}

int prim() {
    int ans = 0;
    for (int i = 2; i <= n; i++) {
        int minc = INF; 
        int p = 1;
        for (int j = 1; j <= n; j++) {
            if (!vis[j] && minc > lowc[j]) {
                minc = lowc[j]; 
                p = j;
            }
        }
        if (minc == INF) return -1;
        if (pre[p] != -1) { //当p不是起点时
            used[pre[p]][p] = used[p][pre[p]] = true; //记录下在最小生成树上的边
            for (int j = 1; j <= n; j++) {
                if (vis[j]) 
                    //Max数组维护最小生成树上，i到j的路径中的最大边权
                    Max[j][p] = Max[p][j] = max(Max[j][pre[p]], lowc[p]);       
            }
        }
        ans += minc;
        vis[p] = true;
        for (int j = 1; j <= n; j++) {
            if (!vis[j] && lowc[j] > cost[p][j]) {
                lowc[j] = cost[p][j];   
                pre[j] = p;
            }
        } 
    }
    return ans;
}

void solve() {
    int temp = prim();
    printf("%d", temp);
    int ans2 = INF;
    //枚举所有不在最小生成树上的边，替换掉最大边权的边
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (cost[i][j] != INF && !used[i][j]) {
                ans2 = min(ans2, temp + cost[i][j] - Max[i][j]);    
            }   
        }   
    }
    printf(" %d\n", ans2);
}

int main() {
    int T;
    scanf("%d", &T);;
    while (T--) {
        input();
        init();
        solve();
    }
    return 0;
}