#681823 (C++17) No.1621 Sequence Inversions

• 問題: No.1621 Sequence Inversions
• ユーザー: KoD
• 提出日時: 2021-07-22 22:18:11
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 59 ms / 3,000 ms
• コード長: 5,664 bytes
• コンパイル時間: 2,505 ms
• コンパイル使用メモリ: 215,804 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-17 18:17:38
• 合計ジャッジ時間: 3,927 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	59 ms; 5,376 KB
testcase_09	AC	51 ms; 5,376 KB
testcase_10	AC	50 ms; 5,376 KB
testcase_11	AC	59 ms; 5,376 KB
testcase_12	AC	43 ms; 5,376 KB
testcase_13	AC	34 ms; 5,376 KB
testcase_14	AC	29 ms; 5,376 KB
testcase_15	AC	30 ms; 5,376 KB
testcase_16	AC	22 ms; 5,376 KB
testcase_17	AC	28 ms; 5,376 KB
testcase_18	AC	21 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	8 ms; 5,376 KB
testcase_21	AC	29 ms; 5,376 KB
testcase_22	AC	30 ms; 5,376 KB
testcase_23	AC	30 ms; 5,376 KB
testcase_24	AC	1 ms; 5,376 KB
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	1 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr usize operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

template <class T> constexpr T totient(T x) {
    T ret = x;
    for (T i = 2; i * i <= x; ++i) {
        if (x % i == 0) {
            ret /= i;
            ret *= i - 1;
            while (x % i == 0) x /= i;
        }
    }
    if (x > 1) {
        ret /= x;
        ret *= x - 1;
    }
    return ret;
}

template <class T> constexpr T rem_euclid(T value, const T& mod) { return (value %= mod) >= 0 ? value : value + mod; }

template <u32 MOD, std::enable_if_t<((u32)1 <= MOD and MOD <= ((u32)1 << 31))>* = nullptr> class StaticModint {
    using Mint = StaticModint;

    static inline constexpr u32 PHI = totient(MOD);
    u32 v;

  public:
    static constexpr u32 mod() noexcept { return MOD; }

    template <class T, std::enable_if_t<std::is_signed_v<T> and std::is_integral_v<T>>* = nullptr>
    static constexpr T normalize(const T x) noexcept {
        return rem_euclid<std::common_type_t<T, i64>>(x, MOD);
    }
    template <class T, std::enable_if_t<std::is_unsigned_v<T> and std::is_integral_v<T>>* = nullptr>
    static constexpr T normalize(const T x) noexcept {
        return x % MOD;
    }

    constexpr StaticModint() noexcept : v(0) {}
    template <class T> constexpr StaticModint(const T x) noexcept : v(normalize(x)) {}
    template <class T> static constexpr Mint raw(const T x) noexcept {
        Mint ret;
        ret.v = x;
        return ret;
    }

    constexpr u32 get() const noexcept { return v; }
    constexpr Mint neg() const noexcept { return raw(v == 0 ? 0 : MOD - v); }
    constexpr Mint inv() const noexcept { return pow(PHI - 1); }
    constexpr Mint pow(u64 exp) const noexcept {
        Mint ret(1), mult(*this);
        for (; exp > 0; exp >>= 1) {
            if (exp & 1) ret *= mult;
            mult *= mult;
        }
        return ret;
    }

    constexpr Mint operator-() const noexcept { return neg(); }
    constexpr Mint operator~() const noexcept { return inv(); }

    constexpr Mint operator+(const Mint& rhs) const noexcept { return Mint(*this) += rhs; }
    constexpr Mint& operator+=(const Mint& rhs) noexcept {
        if ((v += rhs.v) >= MOD) v -= MOD;
        return *this;
    }

    constexpr Mint operator-(const Mint& rhs) const noexcept { return Mint(*this) -= rhs; }
    constexpr Mint& operator-=(const Mint& rhs) noexcept {
        if (v < rhs.v) v += MOD;
        v -= rhs.v;
        return *this;
    }

    constexpr Mint operator*(const Mint& rhs) const noexcept { return Mint(*this) *= rhs; }
    constexpr Mint& operator*=(const Mint& rhs) noexcept {
        v = (u64)v * rhs.v % MOD;
        return *this;
    }

    constexpr Mint operator/(const Mint& rhs) const noexcept { return Mint(*this) /= rhs; }
    constexpr Mint& operator/=(const Mint& rhs) noexcept { return *this *= rhs.inv(); }

    constexpr bool operator==(const Mint& rhs) const noexcept { return v == rhs.v; }
    constexpr bool operator!=(const Mint& rhs) const noexcept { return v != rhs.v; }
    friend std::ostream& operator<<(std::ostream& stream, const Mint& rhs) { return stream << rhs.v; }
};

using Modint1000000007 = StaticModint<1000000007>;
using Modint998244353 = StaticModint<998244353>;

template <class T> using Vec = std::vector<T>;

using Fp = Modint998244353;

void main_() {
    usize N, K;
    std::cin >> N >> K;
    std::map<u32, usize> cnt;
    for (const auto i : rep(0, N)) {
        u32 x;
        std::cin >> x;
        cnt[x] += 1;
    }
    Vec<Fp> dp(1, Fp(1));
    usize small = 0;
    for (const auto& [x, c] : cnt) {
        Vec<Vec<Fp>> calc(small + 1, Vec<Fp>(small * c + 1));
        calc[0][0] = Fp(1);
        for (const auto step : rep(0, c)) {
            Vec<Vec<Fp>> next(small + 1, Vec<Fp>(small * c + 1));
            for (const auto i : rep(0, small + 1)) {
                for (const auto j : rep(0, small * c + 1)) {
                    if (calc[i][j] == Fp(0)) {
                        continue;
                    }
                    for (const auto k : rep(i, small + 1)) {
                        next[k][j + k] += calc[i][j];
                    }
                }
            }
            calc = std::move(next);
        }
        Vec<Fp> sum(small * c + 1);
        for (const auto i : rep(0, small + 1)) {
            for (const auto j : rep(0, small * c + 1)) {
                sum[j] += calc[i][j];
            }
        }
        Vec<Fp> next(dp.size() + small * c);
        for (const auto i : rep(0, dp.size())) {
            for (const auto j : rep(0, small * c + 1)) {
                next[i + j] += dp[i] * sum[j];
            }
        }
        dp = std::move(next);
        small += c;
    }
    dp.resize(N * (N - 1) / 2 + 1);
    std::cout << dp[K] << '\n';
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    main_();
    return 0;
}