結果

問題 No.2616 中央番目の中央値
ユーザー Today03Today03
提出日時 2024-01-27 00:52:59
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 183 ms / 2,000 ms
コード長 4,562 bytes
コンパイル時間 2,358 ms
コンパイル使用メモリ 208,168 KB
実行使用メモリ 10,540 KB
最終ジャッジ日時 2024-01-27 00:53:07
合計ジャッジ時間 7,072 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,676 KB
testcase_01 AC 2 ms
6,676 KB
testcase_02 AC 2 ms
6,676 KB
testcase_03 AC 2 ms
6,676 KB
testcase_04 AC 2 ms
6,676 KB
testcase_05 AC 2 ms
6,676 KB
testcase_06 AC 2 ms
6,676 KB
testcase_07 AC 2 ms
6,676 KB
testcase_08 AC 2 ms
6,676 KB
testcase_09 AC 2 ms
6,676 KB
testcase_10 AC 2 ms
6,676 KB
testcase_11 AC 2 ms
6,676 KB
testcase_12 AC 2 ms
6,676 KB
testcase_13 AC 4 ms
6,676 KB
testcase_14 AC 4 ms
6,676 KB
testcase_15 AC 7 ms
6,676 KB
testcase_16 AC 12 ms
6,676 KB
testcase_17 AC 17 ms
6,676 KB
testcase_18 AC 27 ms
6,676 KB
testcase_19 AC 55 ms
6,676 KB
testcase_20 AC 55 ms
6,676 KB
testcase_21 AC 114 ms
8,192 KB
testcase_22 AC 183 ms
10,524 KB
testcase_23 AC 176 ms
10,540 KB
testcase_24 AC 157 ms
10,540 KB
testcase_25 AC 156 ms
10,540 KB
testcase_26 AC 175 ms
10,540 KB
testcase_27 AC 178 ms
10,540 KB
testcase_28 AC 180 ms
10,540 KB
testcase_29 AC 181 ms
10,540 KB
testcase_30 AC 176 ms
10,540 KB
testcase_31 AC 177 ms
10,540 KB
testcase_32 AC 177 ms
10,540 KB
testcase_33 AC 176 ms
10,540 KB
testcase_34 AC 178 ms
10,540 KB
testcase_35 AC 173 ms
10,540 KB
testcase_36 AC 176 ms
10,540 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#ifdef LOCAL
#include "./debug.cpp"
#else
#define debug(...)
#define print_line
#endif
using namespace std;
using ll = long long;

#include <iostream>

/**
 * @brief Modint
 */

template <long long MOD>
struct modint {
    long long value;
    modint(long long x = 0) {
        if (x >= 0) {
            value = x % MOD;
        } else {
            value = MOD - (-x) % MOD;
        }
    }
    modint operator-() const {
        return modint(-value);
    }
    modint operator+() const {
        return modint(*this);
    }
    modint &operator+=(const modint &other) {
        value += other.value;
        if (value >= MOD) {
            value -= MOD;
        }
        return *this;
    }
    modint &operator-=(const modint &other) {
        value += MOD - other.value;
        if (value >= MOD) {
            value -= MOD;
        }
        return *this;
    }
    modint &operator*=(const modint other) {
        value = value * other.value % MOD;
        return *this;
    }
    modint &operator/=(modint other) {
        (*this) *= other.inv();
        return *this;
    }
    modint operator+(const modint &other) const {
        return modint(*this) += other;
    }
    modint operator-(const modint &other) const {
        return modint(*this) -= other;
    }
    modint operator*(const modint &other) const {
        return modint(*this) *= other;
    }
    modint operator/(const modint &other) const {
        return modint(*this) /= other;
    }
    modint pow(long long x) const {
        modint ret(1), mul(value);
        while (x > 0) {
            if (x % 2 == 1) {
                ret *= mul;
            }
            mul *= mul;
            x /= 2;
        }
        return ret;
    }
    modint inv() const {
        return pow(MOD - 2);
    }
    bool operator==(const modint &other) const {
        return value == other.value;
    }
    bool operator!=(const modint &other) const {
        return value != other.value;
    }
    friend std::ostream &operator<<(std::ostream &os, const modint &x) {
        return os << x.value;
    }
    friend std::istream &operator>>(std::istream &is, modint &x) {
        long long v;
        is >> v;
        x = modint<MOD>(v);
        return is;
    }
};
using mod998 = modint<998244353>;
using mod107 = modint<1000000007>;
using mint = mod998;

#include <vector>
#include <iostream>

/**
 * @brief Fenwick Tree
 * @docs docs/data_structure/fenwick_tree.md
 */

template <typename T>
struct fenwick_tree {
    fenwick_tree(int n) {
        this->n = n;
        dat.resize(n);
    }
    void add(int i, T x) {
        i++;
        while (i <= n) {
            dat[i - 1] += x;
            i += i & -i;
        }
    }
    T operator[](int i) {
        return sum(i, i + 1);
    }
    T sum(int l, int r) {
        return sum(r) - sum(l);
    }
    friend std::ostream &operator<<(ostream &os, fenwick_tree A) {
        int n = A.n;
        os << "[ ";
        for (int i = 0; i < n; i++) {
            os << A[i];
            if (i != n - 1) {
                os << ", ";
            }
        }
        os << " ]";
        return os;
    }

private:
    int n;
    std::vector<T> dat;
    T sum(int r) {
        T ret = 0;
        while (r > 0) {
            ret += dat[r - 1];
            r -= r & -r;
        }
        return ret;
    }
};

#include <vector>

/**
 * @brief Combination
 */

template <typename T>
struct combination {
    std::vector<T> fact, factinv;
    combination(int n) {
        fact.resize(n + 1);
        factinv.resize(n + 1);
        fact[0] = 1;
        for (int i = 1; i <= n; i++) {
            fact[i] = fact[i - 1] * i;
        }
        for (int i = 0; i <= n; i++) {
            factinv[i] = fact[i].inv();
        }
    }
    T nCr(long long n, long long r) {
        if (n < 0 || r < 0 || n - r < 0) {
            return 0;
        }
        return fact[n] * factinv[r] * factinv[n - r];
    }
    T nPr(long long n, long long r) {
        if (n < 0 || r < 0 || n - r < 0) {
            return 0;
        }
        return fact[n] * factinv[n - r];
    }
};

int main() {
    int N;
    cin >> N;
    vector<int> P(N);
    for (int i = 0; i < N; i++) cin >> P[i], P[i]--;

    combination<mint> C(N);
    fenwick_tree<int> FT(N);
    mint ans = 0;
    for (int i = 0; i < N; i++) {
        int ls = FT.sum(0, P[i]);
        int lb = FT.sum(P[i] + 1, N);
        int rs = P[i] - ls;
        int rb = N - i - 1 - rs;

        ans += C.nCr(rb + ls, ls) * C.nCr(lb + rs, rs);
        FT.add(P[i], 1);
    }

    cout << ans << endl;
}
0