算法竞赛进阶指南——0x41【并查集】

引言

并查集普通的就那种
高端的有带边权的并查集和扩展域的并查集

正文

普通并查集

vector<int> size(N, 1); //记录并初始化子树大小为1
inline int get_fa(int v)
{
    return f[v] == v ? v : f[v] = get_fa(f[v]);
} //路径压缩
inline bool megre(int x, int y)
{
    int fx = get_fa(x), fy = get_fa(y);
    if (fx == fy)
        return 1;
    else //启发式合并【按秩合并】
    {
        if (size[fx] > size[fy])
            swap(fx, fy);
        f[fx] = fy;
        size[fy] += size[fx]; //选择点数作为估价函数
        return 0;
    }
}

带边权的并查集

ll getfa(ll x) //带边权的并查集
{
    if (fa[x] != x)
    {
        ll root = getfa(fa[x]);
        val[x] += val[fa[x]]; //对边权求和
        fa[x] = root;         //路径压缩
    }
    return fa[x];
}
void merge(ll x, ll y) //带边权的并查集
{                      //siz[]是集合大小
    ll fax = getfa(x), fay = getfa(y);
    fa[fax] = fay;
    val[fax] += siz[fay]; //注意这里下标是父亲的
    siz[fay] += siz[fax]; //下标不是儿子的
}

例如
[牛客经典例题]食物链

#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 1e5 + 10;
const int M = 2010000;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int eps = 1e-6;
const int INF = INT_MAX;
#define IOS                  \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0)
ll n, k, d, x, y, ans;
ll val[N], fa[N];
void init()
{
    for (int i = 1; i <= n; i++)
        fa[i] = i;
}
ll getfa(ll x)
{
    if (fa[x] != x)
    {
        ll root = getfa(fa[x]);
        val[x] += val[fa[x]];
        fa[x] = root;
    }
    return fa[x];
}
int main()
{
    scanf("%lld%lld", &n, &k);
    init();//初始化QAQ
    while (k--)
    {
        scanf("%lld%lld%lld", &d, &x, &y);
        ll fax = getfa(x), fay = getfa(y);
        if (x > n || y > n)
            ans++;
        else
        {
            if (d == 1)
            {
                if (fax == fay && (val[x] - val[y]) % 3 != 0)
                    ans++;
                else if (fax != fay)
                {
                    fa[fax] = fay;
                    val[fax] = val[y] - val[x];
                }
            }
            else
            {
                if (fax == fay && (val[x] - val[y] - 1) % 3 != 0)//不能写成(val[x]-val[y])%3！=1
                    ans++;
                else if (fax != fay)
                {
                    fa[fax] = fay;
                    val[fax] = val[y] - val[x] + 1;
                }
            }
        }
    }
    printf("%lld\n", ans);
    return 0;
}

扩展域的并查集

补充的内容，还是牛客的经典例题食物链，这次用扩展域的并查集来做

#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 1e5 + 10;
const int M = 2010000;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int eps = 1e-6;
const int INF = INT_MAX;
#define IOS                  \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0)
ll n, k, d, x, y, ans;
ll val[N], fa[N * 3];
void init()
{
    for (int i = 1; i <= 3 * n; i++) //扩展三倍，1~n xy为同类、n+1~2*n x捕食y捕食、2*n+1~3*n y为x天敌
        fa[i] = i;
}
ll getfa(ll x) { return fa[x] == x ? x : getfa(fa[x]); }
void merge(ll x, ll y) //注意是void类型
{
    ll fax = getfa(x), fay = getfa(y);
    if (fax != fay)
        fa[fax] = fay;
}
int main()
{
    scanf("%lld%lld", &n, &k);
    init(); //初始化艹
    while (k--)
    {
        scanf("%lld%lld%lld", &d, &x, &y);
        if (x > n || y > n)
            ans++;
        else
        {
            if (d == 1)
            {
                if (getfa(x) == getfa(y + n) || getfa(x) == getfa(y + 2 * n))
                    ans++;
                else
                {
                    merge(x, y);
                    merge(x + n, y + n);
                    merge(x + 2 * n, y + 2 * n);
                }
            }
            else
            {
                if (getfa(x) == getfa(y) || getfa(x) == getfa(y + 2 * n))
                    ans++;
                else
                {
                    merge(x, y + n);
                    merge(x + n, y + 2 * n);
                    merge(x + 2 * n, y);
                }
            }
        }
    }
    printf("%lld\n", ans);
    return 0;
}

总结

QAQ敬请期待~~~
补完了哈哈 开༺༽ཊ森ཏ༼༻