結果

問題 No.1193 Penguin Sequence
ユーザー MisterMister
提出日時 2020-08-22 15:54:45
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 334 ms / 2,000 ms
コード長 6,180 bytes
コンパイル時間 1,343 ms
コンパイル使用メモリ 116,716 KB
実行使用メモリ 17,280 KB
最終ジャッジ日時 2024-10-15 10:04:18
合計ジャッジ時間 11,234 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 237 ms
17,280 KB
testcase_01 AC 326 ms
17,152 KB
testcase_02 AC 320 ms
17,152 KB
testcase_03 AC 322 ms
17,280 KB
testcase_04 AC 334 ms
17,280 KB
testcase_05 AC 327 ms
17,152 KB
testcase_06 AC 323 ms
17,152 KB
testcase_07 AC 318 ms
17,152 KB
testcase_08 AC 321 ms
17,280 KB
testcase_09 AC 334 ms
17,152 KB
testcase_10 AC 328 ms
17,152 KB
testcase_11 AC 171 ms
12,416 KB
testcase_12 AC 177 ms
12,416 KB
testcase_13 AC 280 ms
15,744 KB
testcase_14 AC 256 ms
14,976 KB
testcase_15 AC 308 ms
16,512 KB
testcase_16 AC 108 ms
7,808 KB
testcase_17 AC 9 ms
6,400 KB
testcase_18 AC 27 ms
7,296 KB
testcase_19 AC 321 ms
17,024 KB
testcase_20 AC 247 ms
14,848 KB
testcase_21 AC 187 ms
13,056 KB
testcase_22 AC 31 ms
7,552 KB
testcase_23 AC 159 ms
12,160 KB
testcase_24 AC 134 ms
11,264 KB
testcase_25 AC 60 ms
8,576 KB
testcase_26 AC 19 ms
6,912 KB
testcase_27 AC 258 ms
15,488 KB
testcase_28 AC 178 ms
12,672 KB
testcase_29 AC 268 ms
15,616 KB
testcase_30 AC 89 ms
9,472 KB
testcase_31 AC 70 ms
8,960 KB
testcase_32 AC 203 ms
13,696 KB
testcase_33 AC 139 ms
11,392 KB
testcase_34 AC 111 ms
10,496 KB
testcase_35 AC 143 ms
11,520 KB
testcase_36 AC 108 ms
10,496 KB
testcase_37 AC 262 ms
15,232 KB
testcase_38 AC 9 ms
6,400 KB
testcase_39 AC 9 ms
6,272 KB
testcase_40 AC 8 ms
6,400 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <functional>

template <int MOD>
struct ModInt {
    using lint = long long;
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt inv() const { return this->pow(MOD - 2); }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt pow(lint n) const {
        auto x = ModInt(1);
        auto b = *this;
        while (n > 0) {
            if (n & 1) x *= b;
            n >>= 1;
            b *= b;
        }
        return x;
    }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }

    // compare
    bool operator==(const ModInt& b) const { return val == b.val; }
    bool operator!=(const ModInt& b) const { return val != b.val; }
    bool operator<(const ModInt& b) const { return val < b.val; }
    bool operator<=(const ModInt& b) const { return val <= b.val; }
    bool operator>(const ModInt& b) const { return val > b.val; }
    bool operator>=(const ModInt& b) const { return val >= b.val; }

    // I/O
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept {
        lint v;
        is >> v;
        x = v;
        return is;
    }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

template <class T>
struct Combination {
    int max_n;
    std::vector<T> f, invf;

    explicit Combination(int n)
        : max_n(n), f(n + 1), invf(n + 1) {
        f[0] = 1;
        for (int i = 1; i <= n; ++i) {
            f[i] = f[i - 1] * i;
        }

        invf[max_n] = f[max_n].inv();
        for (int i = max_n - 1; i >= 0; --i) {
            invf[i] = invf[i + 1] * (i + 1);
        }
    }

    T fact(int n) const { return n < 0 ? T(0) : f[n]; }
    T invfact(int n) const { return n < 0 ? T(0) : invf[n]; }
    T perm(int a, int b) const {
        return a < b || b < 0 ? T(0) : f[a] * invf[a - b];
    }
    T binom(int a, int b) const {
        return a < b || b < 0 ? T(0) : f[a] * invf[a - b] * invf[b];
    }
};

template <class T>
std::map<T, int> compress(std::vector<T>& v) {
    std::sort(v.begin(), v.end());
    v.erase(std::unique(v.begin(), v.end()), v.end());

    std::map<T, int> rev;
    for (int i = 0; i < (int)v.size(); ++i) rev[v[i]] = i;
    return rev;
}

template <class T>
struct SegmentTree {
    using Merger = std::function<T(T, T)>;

    int length;
    std::vector<T> dat;
    T unit;
    Merger merge;

    SegmentTree() = default;

    SegmentTree(int n, const T& unit, const Merger& merge)
        : length(1), unit(unit), merge(merge) {
        while (length < n) length <<= 1;
        dat.assign(length * 2, unit);
    }

    template <class Container>
    SegmentTree(const Container& elems, const T& unit, const Merger& merge)
        : length(1), unit(unit), merge(merge) {
        int n = elems.size();
        while (length < n) length <<= 1;

        dat.assign(length * 2, unit);

        std::copy(elems.begin(), elems.end(), dat.begin() + length);

        for (int nidx = length - 1; nidx >= 1; --nidx) {
            T vl = dat[nidx * 2 + 0];
            T vr = dat[nidx * 2 + 1];
            dat[nidx] = merge(vl, vr);
        }
    }

    void update(int nidx, const T& elem) {
        nidx += length;
        dat[nidx] = elem;

        while (nidx > 0) {
            nidx >>= 1;
            T vl = dat[nidx * 2 + 0];
            T vr = dat[nidx * 2 + 1];
            dat[nidx] = merge(vl, vr);
        }
    }

    T fold(int ql, int qr) const {
        ql = std::max(ql, 0);
        qr = std::min(qr, length);
        ql += length, qr += length;

        T lacc = unit, racc = unit;
        while (ql < qr) {
            if (ql & 1) {
                lacc = merge(lacc, dat[ql]);
                ++ql;
            }
            if (qr & 1) {
                --qr;
                racc = merge(dat[qr], racc);
            }
            ql >>= 1, qr >>= 1;
        }

        return merge(lacc, racc);
    }

    T get(int idx) const { return dat[idx + length]; }
    T fold_all() const { return dat[1]; }
};

constexpr int MOD = 998244353;
using mint = ModInt<MOD>;
const Combination<mint> C(400000);

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> xs(n);
    for (auto& x : xs) std::cin >> x;

    int m;
    {
        auto nxs = xs;
        auto xrev = compress(nxs);

        m = nxs.size();
        for (auto& x : xs) x = xrev[x];
    }

    SegmentTree<int>
        seg(m, 0, [](auto a, auto b) { return a + b; });
    mint rev = 0;
    for (auto x : xs) {
        rev += seg.fold(x + 1, m);
        seg.update(x, seg.get(x) + 1);
    }

    mint ans = 0;
    {
        mint pat = 0;
        for (int l = 2; l <= n; ++l) {
            pat += C.binom(n - 2, l - 2) / C.binom(n, l);
        }
        ans += pat * rev;
    }

    mint allrev = 0;
    for (auto x : xs) {
        allrev += seg.fold(x + 1, m);
    }

    {
        mint pat = 0, sum = 0;
        for (int r = 1; r <= n; ++r) {
            mint p = C.binom(n - 1, r - 1) / C.binom(n, r);
            pat += sum * p;
            sum += p;
        }
        ans += pat * allrev;
    }

    mint tot = 1;
    for (int i = 1; i <= n; ++i) tot *= C.binom(n, i);

    std::cout << ans * tot << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}
0