結果

問題 No.1300 Sum of Inversions
ユーザー scol_kpscol_kp
提出日時 2020-11-28 00:14:42
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 169 ms / 2,000 ms
コード長 8,685 bytes
コンパイル時間 2,404 ms
コンパイル使用メモリ 214,420 KB
実行使用メモリ 15,744 KB
最終ジャッジ日時 2024-07-26 21:21:13
合計ジャッジ時間 7,617 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 127 ms
12,928 KB
testcase_04 AC 119 ms
12,672 KB
testcase_05 AC 99 ms
11,008 KB
testcase_06 AC 139 ms
14,080 KB
testcase_07 AC 135 ms
13,568 KB
testcase_08 AC 153 ms
14,592 KB
testcase_09 AC 149 ms
14,592 KB
testcase_10 AC 77 ms
9,728 KB
testcase_11 AC 80 ms
9,856 KB
testcase_12 AC 124 ms
12,672 KB
testcase_13 AC 121 ms
12,288 KB
testcase_14 AC 169 ms
15,616 KB
testcase_15 AC 150 ms
14,464 KB
testcase_16 AC 123 ms
13,184 KB
testcase_17 AC 75 ms
9,472 KB
testcase_18 AC 88 ms
10,368 KB
testcase_19 AC 108 ms
11,520 KB
testcase_20 AC 108 ms
11,776 KB
testcase_21 AC 108 ms
11,776 KB
testcase_22 AC 100 ms
11,008 KB
testcase_23 AC 143 ms
14,208 KB
testcase_24 AC 102 ms
11,136 KB
testcase_25 AC 84 ms
10,240 KB
testcase_26 AC 82 ms
10,112 KB
testcase_27 AC 90 ms
10,752 KB
testcase_28 AC 155 ms
14,848 KB
testcase_29 AC 106 ms
11,776 KB
testcase_30 AC 150 ms
14,592 KB
testcase_31 AC 98 ms
11,008 KB
testcase_32 AC 101 ms
11,392 KB
testcase_33 AC 27 ms
12,672 KB
testcase_34 AC 39 ms
12,672 KB
testcase_35 AC 86 ms
15,744 KB
testcase_36 AC 91 ms
15,744 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#define FASTIO
using namespace std;

using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;

constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();

template <typename T1, typename T2>
inline bool chmin(T1& a, const T2& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, const T2& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <ostream& os = std::cout>
class Prints {
private:
    class __Prints {
    public:
        __Prints(const char* sep, const char* term) : sep(sep), term(term) {}
        template <class... Args>
        auto operator()(const Args&... args) const -> decltype((os << ... << std::declval<Args>()), void()) { print(args...); }
        template <typename T>
        auto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval<decltype(std::declval<T>()[0])>(), void()) {
            for (size_t i = 0; i < sz; i++)
                os << vec[i] << (i == sz - 1 ? term : sep);
        }
        template <typename T>
        auto pmat(const T& mat, size_t h, size_t w) -> decltype(os << std::declval<decltype(std::declval<T>()[0][0])>(), void()) {
            for (size_t i = 0; i < h; i++)
                for (size_t j = 0; j < w; j++)
                    os << mat[i][j] << (j == w - 1 ? term : sep);
        }

    private:
        const char *sep, *term;
        void print() const { os << term; }
        void print_rest() const { os << term; }
        template <class T, class... Tail>
        void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); }
        template <class T, class... Tail>
        void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); }
    };

public:
    Prints() {}
    __Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};

Prints<> prints;
Prints<std::cerr> prints_err;

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

template <std::int_fast64_t Modulus>
class ModInt {
    using i64 = std::int_fast64_t;

private:
    i64 m_value;

public:
    constexpr ModInt(const i64 x = 0) noexcept : m_value(x) {
        if (m_value < -Modulus || m_value >= Modulus) m_value %= Modulus;
        if (m_value < 0) m_value += Modulus;
    }

    constexpr i64 const& value() const noexcept { return m_value; }

    constexpr ModInt& operator+=(const ModInt rhs) noexcept {
        m_value += rhs.m_value;
        if (m_value >= Modulus) {
            m_value -= Modulus;
        }
        return *this;
    }
    constexpr ModInt& operator-=(const ModInt rhs) noexcept {
        if (m_value < rhs.m_value) {
            m_value += Modulus;
        }
        m_value -= rhs.m_value;
        return *this;
    }
    constexpr ModInt& operator*=(const ModInt rhs) noexcept {
        m_value *= rhs.m_value;
        if (m_value >= Modulus) m_value %= Modulus;
        return *this;
    }
    constexpr ModInt& operator/=(ModInt rhs) noexcept {
        *this *= rhs.inv();
        return *this;
    }

    constexpr ModInt& operator++() noexcept {
        *this += 1;
        return *this;
    }
    constexpr ModInt operator++(int) noexcept {
        ModInt res = *this;
        *this += 1;
        return res;
    }
    constexpr ModInt& operator--() noexcept {
        *this -= 1;
        return *this;
    }
    constexpr ModInt operator--(int) noexcept {
        ModInt res = *this;
        *this -= 1;
        return res;
    }

    constexpr ModInt inv() const noexcept {
        i64 q = m_value;
        i64 b = Modulus, u = 1, v = 0;
        i64 tmp = 0;
        while (b) {
            i64 t = q / b;
            q -= t * b;
            tmp = q, q = b, b = tmp;
            u -= t * v;
            tmp = u, u = v, v = tmp;
        }
        if (u < -Modulus || u >= Modulus) u %= Modulus;
        if (u < 0) u += Modulus;
        return u;
    }

    constexpr ModInt pow(i64 k) const noexcept {
        ModInt res = 1;
        ModInt tmp = 0;
        if (k < 0) {
            tmp = this->inv();
            k = -k;
        }
        else {
            tmp = *this;
        }
        for (; k > 0; k >>= 1) {
            if (k & 1) res *= tmp;
            tmp *= tmp;
        }
        return res;
    }

    friend constexpr ModInt operator+(const ModInt& a) noexcept {
        return a;
    }
    friend constexpr ModInt operator-(const ModInt& a) noexcept {
        return ModInt(0) - a;
    }
    friend constexpr ModInt operator+(const ModInt& lhs, const ModInt& rhs) noexcept {
        return ModInt<Modulus>(lhs) += rhs;
    }
    friend constexpr ModInt operator-(const ModInt& lhs, const ModInt& rhs) noexcept {
        return ModInt<Modulus>(lhs) -= rhs;
    }
    friend constexpr ModInt operator*(const ModInt& lhs, const ModInt& rhs) noexcept {
        return ModInt<Modulus>(lhs) *= rhs;
    }
    friend constexpr ModInt operator/(const ModInt& lhs, const ModInt& rhs) noexcept {
        return ModInt<Modulus>(lhs) /= rhs;
    }

    friend constexpr bool operator<(const ModInt& lhs, const ModInt& rhs) noexcept {
        return lhs.m_value < rhs.m_value;
    }
    friend constexpr bool operator>(const ModInt& lhs, const ModInt& rhs) noexcept {
        return lhs.m_value > rhs.m_value;
    }
    friend constexpr bool operator<=(const ModInt& lhs, const ModInt& rhs) noexcept {
        return lhs.m_value <= rhs.m_value;
    }
    friend constexpr bool operator>=(const ModInt& lhs, const ModInt& rhs) noexcept {
        return lhs.m_value >= rhs.m_value;
    }

    friend constexpr bool operator==(const ModInt& lhs, const ModInt& rhs) noexcept {
        return lhs.m_value == rhs.m_value;
    }
    friend constexpr bool operator!=(const ModInt& lhs, const ModInt& rhs) noexcept {
        return lhs.m_value != rhs.m_value;
    }

    friend std::istream& operator>>(std::istream& is, ModInt& rhs) {
        i64 a;
        is >> a;
        rhs = a;
        return is;
    }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& rhs) {
        os << rhs.m_value;
        return os;
    }
};

constexpr long long MOD = 998244353;
using Mint = ModInt<MOD>;

template <typename T>
class BIT {
private:
    int n;
    std::vector<T> vec;

public:
    BIT(int n) : n(n), vec(n + 1) {}
    void add(int i, const T& a) {
        for (++i; i <= n; i += i & (-i)) {
            vec[i] += a;
        }
    }
    T query(int i) const {
        T res = 0;
        for (; i >= 1; i -= i & (-i)) {
            res += vec[i];
        }
        return res;
    }
    T query(int i, int j) const {
        return query(j) - query(i);
    }
    size_t size() const noexcept {
        return n;
    }
    void reset() noexcept {
        std::fill(vec.begin(), vec.end(), static_cast<T>(0));
    }
};

void solve() {
    int N;
    cin >> N;
    Vl A(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    Vl cc = A;
    sort(cc.begin(), cc.end());
    cc.erase(unique(cc.begin(), cc.end()), cc.end());
    int sz = (int)cc.size();
    BIT<Mint> fwt1(sz), fwt2(sz);
    vector<Mint> sums_l(N), sums_r(N);
    vector<Mint> cnts_l(N), cnts_r(N);
    for (ll i = 0; i < N; i++) {
        int idx = lower_bound(cc.begin(), cc.end(), A[i]) - cc.begin();
        sums_l[i] = fwt1.query(idx + 1, sz);
        cnts_l[i] = fwt2.query(idx + 1, sz);
        fwt1.add(idx, A[i]);
        fwt2.add(idx, 1);
    }
    fwt1.reset(), fwt2.reset();
    for (ll i = N - 1; i >= 0; i--) {
        int idx = lower_bound(cc.begin(), cc.end(), A[i]) - cc.begin();
        sums_r[i] = fwt1.query(0, idx);
        cnts_r[i] = fwt2.query(0, idx);
        fwt1.add(idx, A[i]);
        fwt2.add(idx, 1);
    }
    Mint ans = 0;
    for (ll i = 0; i < N; i++) {
        if (cnts_l[i] > 0 && cnts_r[i] > 0) {
            ans += sums_l[i] * cnts_r[i] + sums_r[i] * cnts_l[i] + A[i] * cnts_l[i] * cnts_r[i];
        }
    }
    prints()(ans);
}

//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

int main() {
#ifdef FASTIO
    std::cin.tie(nullptr), std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
#endif
#ifdef FILEINPUT
    std::ifstream ifs("./in_out/input.txt");
    std::cin.rdbuf(ifs.rdbuf());
#endif
#ifdef FILEOUTPUT
    std::ofstream ofs("./in_out/output.txt");
    std::cout.rdbuf(ofs.rdbuf());
#endif
    std::cout << std::setprecision(18) << std::fixed;
    solve();
    std::cout << std::flush;
    return 0;
}
0