LightOJ 1029 Civil and Evil Engineer

分别跑一次最小生成树和最大生成树

#include <cstdio>
#include <algorithm>
using namespace std;

struct Line
{
    int l, r, v;
}L[12005];
bool operator < (Line a, Line b) {return a.v < b.v;}

int L_size, n, fa[105];

int find(int i)
{
    if(fa[i] != i)
        fa[i] = find(fa[i]);
    return fa[i];
}
void solve()
{
    int Min = 0, Max = 0;
    for(int i = 0; i <= n; i++) fa[i] = i;
    for(int i = 0; i < L_size; i++)
    {
        int x = find(L[i].l), y = find(L[i].r);
        if(x != y) Min += L[i].v, fa[x] = y;
    }
    for(int i = 0; i <= n; i++) fa[i] = i;
    for(int i = L_size - 1; i >= 0; i--)
    {
        int x = find(L[i].l), y = find(L[i].r);
        if(x != y) Max += L[i].v, fa[x] = y;
    }

    if((Min + Max) % 2 == 0) printf("%d\n", (Min + Max) / 2);
    else printf("%d/2\n", Min + Max);
}

int main()
{
    int T;
    scanf("%d", &T);

    for(int ca = 1; ca <= T; ca++)
    {
        printf("Case %d: ", ca);
        scanf("%d", &n);
        L_size = 0;
        while(scanf("%d%d%d", &L[L_size].l, &L[L_size].r, &L[L_size].v) && L[L_size].v != 0)
            L_size++;
        sort(L, L + L_size);
        solve();
    }

    return 0;
}