acm 第十天：并查集&最小生成树

#include<iostream>
#include<string.h>
#include<algorithm>
#include<cstdio>
using namespace std;
#define Max 110
#define ll long long
#define INF 0x3f3f3f3f

int fa[1002],ans,n,m,a,b;


int Find(int x){
    if(x==fa[x])return x;
    return fa[x]=Find(fa[x]);
}
int Merge(int x,int y){
    fa[Find(x)]=Find(y);
}

int main()
{
    while(scanf("%d",&n),n!=0)
    {
        ans=0;
        scanf("%d",&m);
        for(int i=1;i<=n;i++)
            fa[i]=i;
        for(int i=1;i<=m;i++)
        {
            scanf("%d %d",&a,&b);
            Merge(a,b);
        }
        for(int i=1;i<=n;i++)
            if(fa[i]==i) ans++;
        printf("%d\n",ans-1);
    }
}

#include<iostream>
#include<string.h>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;
#define Max 110
#define ll long long
#define INF 0x3f3f3f3f

struct node
{
    int x,y,z;
}edge[2000];

int fa[2000],ans,n,m,a,b,c;

bool cmp(node a,node b)
{
    return a.z<b.z;
}
int Find(int x){
    if(x==fa[x])return x;
    return fa[x]=Find(fa[x]);
}
int Kruskal() {
	for (int i=1;i<=n;i++) fa[i]=i;
	sort(edge+1,edge+1+m,cmp);
	for (int i=1;i<=m;i++)  {
		int x=Find(edge[i].x),y=Find(edge[i].y);
		if (x==y) continue;
		fa[x]=y;
		ans+=edge[i].z;
	}
	return ans;
}
int main()
{
    while(scanf("%d",&n)!=EOF&&n)
    {
        ans=0;
        scanf("%d",&m);
        memset(edge,0,sizeof edge);
        for(int i=1;i<=m;i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            edge[i].x=a;
            edge[i].y=b;
            edge[i].z=c;
        }
        printf("%d\n",Kruskal());
    }
}

#include<bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
const int N=2e5+10;
int n,k,ans,op,x,y;
int fa[N];
int Find(int x)
{
    if (fa[x]==x) return x;
    return fa[x]=Find(fa[x]);
}
int main()
{
    scanf("%d%d",&n,&k);
    for (int i=1;i<=3*n;i++) fa[i]=i;
    for (int i=1;i<=k;i++)
    {
        scanf("%d%d%d",&op,&x,&y);
        if (x>n||y>n||(op==2&&x==y))
        {
            ans++;
            continue;
        }
        int x_eat=x+n,x_enemy=x+2*n;
        int y_eat=y+n,y_enemy=y+2*n;
        if (op==1)
        {
            if (Find(x_eat)==Find(y)||Find(x)==Find(y_eat)) ans++;
            else
            {
                fa[Find(x)]=Find(y);
                fa[Find(x_eat)]=Find(y_eat);
                fa[Find(x_enemy)]=Find(y_enemy);
            }
        }
        else
        {
            if (Find(x)==Find(y)||Find(x_enemy)==Find(y)) ans++;
            else
            {
                fa[Find(x_eat)]=Find(y);
                fa[Find(y_enemy)]=Find(x);
                fa[Find(x_enemy)]=Find(y_eat);
            }
        }
    }
    printf("%d\n",ans);
    return 0;
}