E - Ginger的染色(并查集 + 轮换序列)

 主要是判断该序列中有无元素个数为奇数的轮换序列，可以用并查集来找，这里另外写一种方法

 ACcode

// #pragma GCC optimize (2)
// #pragma G++ optimize (2)
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <unordered_map>
#include <map>
#include <bitset>
#include <set>
#define endl '\n'
#define int long long
const double esp = 1e-5;
using namespace std;
void TLE() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); }
const int INF=2e9;
const int N=1e5+10;
const int mod=998244353;
int a[N];
bool st[N];
int qmi(int a,int b)
{
    int res=1%mod;
    while(b)
    {
        if(b&1)res=res*a%mod;
        a=a*1LL*a%mod;
        b>>=1;
    }
    return res;
}
void solve()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        if(st[i])continue;
        int u=i,res=1;
        while(i!=a[u])
        {
            res++;
            u=a[u];
            st[u]=true;
        }
        if(res&1)
        {
            cout<<0<<endl;
            return;
        }
        else ans++;
    }
    cout<<qmi(2,ans)<<endl;
}
signed main()
{
    TLE();
    int T;T = 1;
    //int T;cin>>T;
    while (T--)solve();
    return 0;
}

ACcode(并查集)

// #pragma GCC optimize (2)
// #pragma G++ optimize (2)
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <unordered_map>
#include <map>
#include <bitset>
#include <set>
#define endl '\n'
#define int long long
#define lowbit(x) x &(-x)
#define rep(i, a, n) for (int i = a; i <= n; i++)
const double esp = 1e-5;
using namespace std;
void TLE() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); }
const int INF = 2e9;
const int N = 1e5 + 10;
const int mod= 998244353;
typedef pair<int, int> PII;
int a[N];int p[N];int sz[N];
int qmi(int a,int b)
{
    int res=1%mod;
    while(b)
    {
        if(b&1)res=res*a%mod;
        a=a*1LL*a%mod;
        b>>=1;
    }
    return res;
}
int find(int x)
{
    if (x != p[x])
        p[x] = find(p[x]);
    return p[x];
}
void merge(int a, int b)
{
    a = find(a), b = find(b);
    if (a != b)
    {
        p[a] = p[b];
        sz[b] += sz[a];
    }
}
void solve()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        p[i] = i;
        sz[i] = 1;
    }
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        merge(i, a[i]);
    }
    int res = 0;
    for (int i = 1; i <= n; i++)
    {
        if (p[i] == i)
        {
            if (sz[i] % 2 == 1)
            {
                cout << "0" << endl;
                return;
            }
            else
                res++;
        }
    }
    cout << qmi(2,res) << endl;
}
signed main()
{
    TLE();
    int T;
    T = 1;
    // int T;cin>>T;
    while (T--)
        solve();
    return 0;
}