2021ICPC济南C题

#include <iostream>
#include <algorithm>

using namespace std;

typedef long long LL;

const int N = 1000010;
const int mod = 998244353;
int cnt[N];
int len;
int a[N];
int n;

int fact[N], infact[N];

int qmi(int a, int k, int p)
{
    int res = 1;
    while (k)
    {
        if (k & 1)
            res = (LL)res * a % p;
        a = (LL)a * a % p;
        k >>= 1;
    }
    return res;
}

int main(void)
{
    fact[0] = infact[0] = 1;
    for (int i = 1; i < N; i++)
    {
        fact[i] = (LL)fact[i - 1] * i % mod;
        infact[i] = (LL)infact[i - 1] * qmi(i, mod - 2, mod) % mod;
    }

    cin >> n;
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }
    sort(a, a + n);
    int cur = 0;
    for (int i = 0; i < n; i++)
    {
        if (a[i] != cur)
        {
            ++len;
            cur = a[i];
            cnt[len] = 1;
        }
        else
            cnt[len]++;
    }

    LL ans = 1;
    int sum = 0;
    for (int i = 1; i <= len; i++)
    {
        int b = cnt[i] / 2;
        int a = sum + b;
        ans = ans * (LL)fact[cnt[i]] % mod * fact[a] % mod * infact[b] % mod * infact[a - b] % mod;
        sum += cnt[i];
    }

    cout << ans;

    return 0;
}