1107 并查集

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
using namespace std;
const int maxn = 1010;
int father[maxn],isroot[maxn]={0},course[maxn] = {0};

void initiate(int x)
{
    for(int i = 1;i<=x;i++) //初始化
    {
        father[i] = i;
        isroot[i] = false;
    }
}

int findfather(int x)
{
    int a = x;
    while(x != father[x])
        x = father[x];

    while(a != father[a]) //路径压缩
    {
        int z = a;
        a = father[a];
        father[z] = x;
    }
    return x;
}

void Union(int a,int b)
{
    int fa = findfather(a);
    int fb = findfather(b);
    if(fa != fb)
        father[fa] = fb;
}

bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
    freopen("1.txt","r",stdin);
    int n,t,temp;
    scanf("%d",&n);
    initiate(n);  //初始化！！！
    for(int i = 1;i<=n;i++)
    {
        scanf("%d:",&t);
        for(int j = 0;j<t;j++)
        {
            scanf("%d",&temp);
            if(course[temp] == 0) //如果第一次有人喜欢，记录
                course[temp] = i;
            Union(i,findfather(course[temp]));  //合并
        }
    }
    for(int i = 1;i<=n;i++)
    {
        isroot[findfather(i)]++; //根节点
    }
    int ans = 0;
    for(int i = 1;i<=n;i++)
    {
        if(isroot[i] != 0)
            ans++ ;
    }
    printf("%d\n",ans);
    sort(isroot+1,isroot+n+1,cmp);
    for(int i = 1;i<=ans;i++)
    {
        printf("%d",isroot[i]);
        if(i < ans)
            printf(" ");
    }
    return 0;
}

世界未解之谜，为什么从0开始只有2个点过了，而从1到n就全对？？？

//错误
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
using namespace std;
const int maxn = 1010;
int father[maxn],isroot[maxn]={0},course[maxn] = {0};

void initiate(int x)
{
    for(int i = 0;i<x;i++) //初始化
    {
        father[i] = i;
        isroot[i] = false;
    }
}

int findfather(int x)
{
    int a = x;
    while(x != father[x])
        x = father[x];

    while(a != father[a]) //路径压缩
    {
        int z = a;
        a = father[a];
        father[z] = x;
    }
    return x;
}

void Union(int a,int b)
{
    int fa = findfather(a);
    int fb = findfather(b);
    if(fa != fb)
        father[fa] = fb;
}

bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
//     freopen("1.txt","r",stdin);
    int n,t,temp;
    scanf("%d",&n);
    initiate(n);  //初始化！！！
    for(int i = 0;i<n;i++)
    {
        scanf("%d:",&t);
        for(int j = 0;j<t;j++)
        {
            scanf("%d",&temp);
            if(course[temp] == 0) //如果第一次有人喜欢，记录
                course[temp] = i;
            Union(i,findfather(course[temp]));  //合并
        }
    }
    for(int i = 0;i<n;i++)
    {
        isroot[findfather(i)]++; //根节点
    }
    int ans = 0;
    for(int i = 0;i<n;i++)
    {
        if(isroot[i] != 0)
            ans++ ;
    }
    printf("%d\n",ans);
    sort(isroot,isroot+n,cmp);
    for(int i = 0;i<ans;i++)
    {
        printf("%d",isroot[i]);
        if(i != ans - 1)
            printf(" ");
    }
    return 0;
}