Conscription 【POJ - 3723】【最大生成树】

题目链接

---

  看到这道题之后，手玩一下，想到了一种无厘头的最大生成树，然后将kruskal的快排反一下，就A了，倒是不难。记得最后用所有点*10000然后减去最大生成树的权值即可。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define efs 1e-6
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef double lb;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 2e4 + 7;
int N, M, R, all, root[maxN], ans;
int fid(int x) { return x == root[x] ? x : root[x] = fid(root[x]); }
struct Eddge
{
    int u, v, w;
    friend bool operator < (Eddge e1, Eddge e2) { return e1.w > e2.w; }
}edge[50005];
inline void init()
{
    ans = 0;
    for(int i=0; i<all; i++) root[i] = i;
}
int main()
{
    int Cas; scanf("%d", &Cas);
    while(Cas--)
    {
        scanf("%d%d%d", &N, &M, &R);
        all = N + M;
        init();
        for(int i=1; i<=R; i++)
        {
            scanf("%d%d%d", &edge[i].u, &edge[i].v, &edge[i].w);
            edge[i].v += N;
        }
        sort(edge + 1, edge + R + 1);
        for(int i=1, u, v; i<=R; i++)
        {
            u = fid(edge[i].u); v = fid(edge[i].v);
            if(u != v)
            {
                root[u] = v;
                ans += edge[i].w;
            }
        }
        printf("%d\n", all * 10000 - ans);
    }
    return 0;
}