hdu3926 Hand in Hand 同构图★

#include <iostream>
#include <algorithm>
#include <string.h>
#include <cstdio>

using namespace std;

#define MAXN 10000 + 10

int pre[MAXN];

struct Node
{
    int num;
    bool iscircle;
}node1[MAXN], node2[MAXN];
int degree[MAXN];

bool cmp(Node a, Node b)
{
    if (a.num == b.num)
    {
        return a.iscircle > b.iscircle;
    }
    else
    {
        return a.num > b.num;
    }
}

int find(int x)
{
    return x == pre[x] ? x : (pre[x] = find(pre[x]));
}

void input()
{
    int t, n, m, k = 0;

    cin >> t;

    while (t--)
    {
        int u, v;

        cin >> n >> m;

        memset(node1, 0, sizeof(node1));
        memset(node2, 0, sizeof(node2));
        memset(degree, 0, sizeof(degree));

        for (int i = 0; i <= n; i++)
        {
            pre[i] = i;
        }

        for (int i = 0; i < m; i++)
        {
            scanf("%d %d", &u, &v);

            int fu = find(u), fv = find(v);
            degree[u]++;
            degree[v]++;

            if (fu != fv)
            {
                pre[fu] = fv;
            }
        }

        for (int i = 1; i <= n; i++)
        {
            node1[find(i)].num++;
            if (degree[i] == 1)
            {
                node1[find(i)].iscircle = true;
            }
        }

        sort(node1 + 1, node1 + n + 1, cmp);

        memset(degree, 0, sizeof(degree));

        cin >> n >> m;

        for (int i = 0; i <= n; i++)
        {
            pre[i] = i;
        }

        for (int i = 0; i < m; i++)
        {
            scanf("%d %d", &u, &v);

            int fu = find(u), fv = find(v);
            degree[u]++;
            degree[v]++;

            if (fu != fv)
            {
                pre[fu] = fv;
            }
        }

        for (int i = 1; i <= n; i++)
        {
            node2[find(i)].num++;
            if (degree[i] == 1)
            {
                node2[find(i)].iscircle = true;
            }
        }

        sort(node2 + 1, node2 + n + 1, cmp);

        bool ok = true;

        for (int i = 1; i <= n; i++)
        {
            if (node1[i].num != node2[i].num || node1[i].iscircle != node2[i].iscircle)
            {
                ok = false;
                break;
            }
        }

        cout << "Case #" << ++k << ": " << (ok ? "YES" : "NO") << endl;
    }
}

int main()
{
    input();
    return 0;
}

并差集的子节点都要更新了,不然要出错。