【Kickstart】2019 Round E - Cherries Mesh

解法

就是想求最小生成树，但是边的权重只有1和2，而且给出了权重为1的边，剩余边权重都为2
显然，可以用最小生成树的某个算法，权重为1的边只加上那些能联通两个不同集合的边
输入完毕之后会得到k个联通分量，需要k-1条权重为2的边，所以ans要再加上2(k-1)

#include <stdio.h>
#include <string>
#include <iostream>
#include <memory.h>
#include <stdlib.h>
#include <cmath>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <algorithm>
#include <functional>

#define MAXN 100010
#define NINF -100000
#define INF 65536


using namespace std;

typedef long long lld;

int n,m;
int f[MAXN];

int find(int x) {
    int r = x;
    while(f[r]!=r) {
        r = f[r];
    }
    while(f[x]!=r) {
        int tmp = f[x];
        f[x] = r;
        x = tmp;
    }
    return r;
}

lld solve() {
    lld ans = 0;
    int solitude = n;
    for(int i=1;i<=n;++i)
        f[i] = i;
    int x,y;
    for(int i=0;i<m;++i) {
        scanf("%d%d", &x,&y);
        int rx = find(x), ry = find(y);
        if(rx!=ry) {
            ans++;
            f[rx] = ry;
            solitude--;
        }
    }
    ans += ((lld)solitude-1)*2;
    return ans;
}

int main() {
    int t;
    scanf("%d",&t);
    for(auto round=1;round<=t;++round) {
        scanf("%d%d",&n,&m);
        printf("Case #%d: %lld\n",round,solve());
    }
}