【Codeforces875F】Royal Questions

直接把读入当成连边，就是个类似于最小生成树的最大生成基环树森林什么的问题。

#include <bits/stdc++.h>
#define gc getchar()
#define ll long long
#define N 200009
using namespace std;
int n,m,fa[N],tg[N],Ans=0;
struct edge
{
    int x,y,val;
    bool operator <(const edge &rhs) const
    {
        return val>rhs.val;
    }
}e[N<<1];
int read()
{
    int x=1;
    char ch;
    while (ch=gc,ch<'0'||ch>'9') if (ch=='-') x=-1;
    int s=ch-'0';
    while (ch=gc,ch>='0'&&ch<='9') s=s*10+ch-'0';
    return s*x;
}
int find(int x)
{
    return fa[x]==x?x:fa[x]=find(fa[x]);
}
int main()
{
    n=read(),m=read();
    for (int i=1;i<=m;i++)
    {
        int x=read(),y=read(),z=read();
        e[i]=(edge){x,y,z};
    }
    for (int i=1;i<=n;i++) fa[i]=i,tg[i]=0;
    sort(e+1,e+m+1);
    for (int i=1;i<=m;i++)
    {
        int x=e[i].x,y=e[i].y;
        if (find(x)!=find(y))
        {
            if (tg[find(x)]+tg[find(y)]<2)
            {
                tg[find(y)]+=tg[find(x)];
                fa[find(x)]=find(y);
                Ans+=e[i].val;
            }
        }
        else
        {
            if (!tg[find(x)])
            {
                tg[find(x)]++;
                Ans+=e[i].val;
            }
        }
    }
    printf("%d\n",Ans);
    return 0;
}