I - Invoking the Magic (并查集+map映射)

并查集，由于数据大小很大，用map进行映射后查询较慢（底层实现是RB树）会超时，但用unordered_map查询（底层实现是哈希表）不会超时。

两种map的比较

AC 代码

#include<iostream>
#include<cstring>
#include<algorithm>
#include<unordered_map>
#define FAST ios::sync_with_stdio(false)
#define int long long
#define sc(n) scanf("%d",&n)
#define pr(n) printf("%d",n);
#define rep(i,n) for(int i=1;i<=n;++i)
#define per(i,n) for(int i=n-1;i>=1;--i)
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
using namespace std;
unordered_map<int, int>mp,ans;
int a[N], b[N];
int find(int x)
{
    if (mp[x] != x)mp[x] = find(mp[x]);
    return mp[x];
}
void solve()
{
    mp.clear();
    ans.clear();
    int n;
    cin >> n;
    rep(i, n)
    {
        cin >> a[i] >> b[i];
        mp[a[i]] = a[i];
        mp[b[i]] = b[i];
    }
    rep(i, n)
    {
        int x = find(a[i]), y = find(b[i]);
        if (x != y)
            mp[y] = mp[x];
    }
    int maxx = 0;
    rep(i,n)
    {
        ans[find(a[i])]++;
        ans[find(b[i])]++;
        maxx = max(ans[find(a[i])],maxx);
        maxx = max(ans[find(b[i])], maxx);
    }
    cout << maxx/2 << endl;//求的是袜子有几双
}

signed  main()
{
    FAST;//不关同步流输入输出超时
    int _;
    cin >> _;
    while (_--)
    {
        solve();
    }
    return 0;
}