結果

問題 No.1300 Sum of Inversions
ユーザー kjnh10kjnh10
提出日時 2020-11-27 22:19:10
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,001 ms / 2,000 ms
コード長 9,575 bytes
コンパイル時間 3,619 ms
コンパイル使用メモリ 221,704 KB
実行使用メモリ 31,256 KB
最終ジャッジ日時 2023-10-01 06:31:26
合計ジャッジ時間 27,791 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 11 ms
15,344 KB
testcase_01 AC 11 ms
15,396 KB
testcase_02 AC 11 ms
15,540 KB
testcase_03 AC 780 ms
27,604 KB
testcase_04 AC 748 ms
27,180 KB
testcase_05 AC 589 ms
25,392 KB
testcase_06 AC 856 ms
29,068 KB
testcase_07 AC 830 ms
28,480 KB
testcase_08 AC 924 ms
29,852 KB
testcase_09 AC 896 ms
29,784 KB
testcase_10 AC 470 ms
23,676 KB
testcase_11 AC 477 ms
23,596 KB
testcase_12 AC 753 ms
27,336 KB
testcase_13 AC 698 ms
27,020 KB
testcase_14 AC 1,001 ms
30,868 KB
testcase_15 AC 915 ms
29,536 KB
testcase_16 AC 799 ms
27,952 KB
testcase_17 AC 457 ms
23,380 KB
testcase_18 AC 532 ms
24,512 KB
testcase_19 AC 638 ms
26,076 KB
testcase_20 AC 673 ms
26,140 KB
testcase_21 AC 656 ms
26,416 KB
testcase_22 AC 577 ms
25,268 KB
testcase_23 AC 822 ms
28,944 KB
testcase_24 AC 583 ms
25,596 KB
testcase_25 AC 488 ms
24,104 KB
testcase_26 AC 481 ms
24,204 KB
testcase_27 AC 544 ms
25,036 KB
testcase_28 AC 925 ms
30,084 KB
testcase_29 AC 612 ms
26,284 KB
testcase_30 AC 904 ms
29,792 KB
testcase_31 AC 585 ms
25,464 KB
testcase_32 AC 618 ms
25,812 KB
testcase_33 AC 125 ms
18,724 KB
testcase_34 AC 136 ms
18,776 KB
testcase_35 AC 455 ms
31,152 KB
testcase_36 AC 461 ms
31,256 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

// template version 2.0
using namespace std;
#include <bits/stdc++.h>

// varibable settings
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T, class U> inline void chmax(T &a, const U &b) { if ((a) < (b)) (a) = (b); }
template <class T, class U> inline void chmin(T &a, const U &b) { if ((a) > (b)) (a) = (b); }
template <typename X, typename T> auto make_table(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto make_table(X x, Y y, Z z, Zs... zs) { auto cont = make_table(y, z, zs...); return vector<decltype(cont)>(x, cont); }

template <class T> T cdiv(T a, T b){ assert(a >= 0 && b > 0); return (a+b-1)/b; }

#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x) sort(all(x)); x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef long double ld;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;

template <typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;
void check_input() { assert(cin.eof() == 0); int tmp; cin >> tmp; assert(cin.eof() == 1); }

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"
template<class T=ll> using vec = vector<T>;
struct Fast { Fast() { std::cin.tie(0); ios::sync_with_stdio(false); } } fast;

const int mod = 998244353;
struct modint {  //{{{
    ll x;
    modint(ll x = 0) : x((x % mod + mod) % mod) {}

    // ?= operator
    modint& operator+=(const modint a) {
        (x += a.x) %= mod;
        return *this;
    }
    modint& operator-=(const modint a) {
        (x += mod - a.x) %= mod;
        return *this;
    }
    modint& operator*=(const modint a) {
        (x *= a.x) %= mod;
        return *this;
    }
    modint& operator/=(const modint& rhs) {
        if (rhs.x == 0) throw runtime_error("modint zero division");
        return *this *= rhs.inv();
    }

    modint operator+(const modint a) const {
        modint res(*this);
        return res += a;
    }
    modint operator-(const modint a) const {
        modint res(*this);
        return res -= a;
    }
    modint operator*(const modint a) const {
        modint res(*this);
        return res *= a;
    }
    modint operator/(const modint a) const {
        modint res(*this);
        return res /= a;
    }

    modint pow(ll n) const {
        modint res(1), x(*this);
        if (n < 0) {
            n = -n;
            x = (*this).inv();
        }
        while (n) {
            if (n & 1) res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }

    modint inv() const {
        if (x == 0) throw runtime_error("inv does not exist");
        return pow(mod - 2);
    }
    // modint inv()const{
    //     int x,y;
    //     int g=extgcd(v,mod,x,y);
    //     assert(g==1);
    //     if(x<0)x+=mod;
    //     return modint(x);
    // }

    bool operator<(const modint& r) const { return x < r.x; }
    bool operator==(const modint& r) const { return x == r.x; }
};
istream& operator>>(istream& is, const modint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const modint& a) { return os << a.x; }
string to_string_mod(const modint& x){ return to_string(x.x); }
//}}}
using mint = modint;

struct zipper {                             /*{{{*/
    // unordered_map<long long, int> zip_map;  // [2:0, 3:1, 5:2, 10:3] debugしづらい
    map<long long, int> zip_map;  // [2:0, 3:1, 5:2, 10:3]
    vector<long long> _unzipper;            // [2, 3, 5, 10]
    bool _is_build = false;
    int n = 0;

    zipper(){};
    zipper(long long inf_value) { /*{{{*/
        _unzipper.push_back(-inf_value);
        _unzipper.push_back(inf_value);
    }                                                        /*}}}*/

    template <class T>
        zipper(const vector<T>& a, long long inf_value = inf<ll>) { /*{{{*/
            _unzipper = vector<long long>(sz(a));
            rep(i, sz(a)) { _unzipper[i] = a[i]; }
            _unzipper.push_back(-inf_value);
            _unzipper.push_back(inf_value);
            build();
        }                              /*}}}*/
    void add_value(long long lv) { /*{{{*/
        _unzipper.push_back(lv);
        _is_build = false;
    }              /*}}}*/
    void build() { /*{{{*/
        uni(_unzipper);
        zip_map.clear();
        n = sz(_unzipper);
        rep(i, n) { zip_map[_unzipper[i]] = i; }
        _is_build = true;
    }                              /*}}}*/
    vector<int> zip(vector<long long> lvs) { /*{{{*/
        if (!_is_build) assert(false);
        int n = sz(lvs);
        vector<int> res(n);
        rep(i, n) res[i] = zip_map[lvs[i]];
        return res;
    }                              /*}}}*/
    int zip(long long lv) { /*{{{*/
        if (!_is_build) assert(false);
        return zip_map[lv];
    }                                               /*}}}*/
    int operator()(long long lv) { return zip(lv); }

    long long unzip(int sv) { /*{{{*/
        if (!_is_build) assert(false);
        return _unzipper[sv];
    }                              /*}}}*/
    int operator[](int sv) { return unzip(sv); }

    int size() {return n;}

#if defined(PCM) || defined(LOCAL) /*{{{*/
    friend ostream& operator<<(ostream& os, const zipper& zp) {
        os << endl;
        os << "_is_build: " << zp._is_build << endl;
        os << "zip_map:   " << zp.zip_map << endl;
        os << "_unzipper:   " << zp._unzipper << endl;
        return os;
    }
#endif /*}}}*/
};     /*}}}*/
// How to use {{{
// construct
// auto z = zipper(x, inf<ll>);

// z.add_value(3);
// z.add_value(5);
// z.add_value(10);
// z.add_value(100000000);
// z.build();

// other method
// z(x[i]); -> zipped x[i]
// z.unzip(z(x[i])) -> x[i];
// z.zip(ll x) -> zipped x
// z.zip(vl v) -> zipped v
// }}}

template <typename T = ll>
struct bit {  //{{{
    int n;
    vector<T> dat;
    vector<T> raw;

    bit(int _n = 0) {  //{{{
        n = _n;
        dat = vector<T>(n);
        raw = vector<T>(n);
    }  //}}}

    bit(vector<T> a) {  // {{{
        n = (int)a.size();
        dat = vector<T>(n);
        raw = vector<T>(n);
        for (int i = 0; i < n; i++) {
            add(i, a[i]);
            raw[i] = a[i];
        }
    }  //}}}

    T _rsum(int i) {  //{{{ [0, i]
        T s = 0;
        while (i >= 0) {
            s += dat[i];
            i = (i & (i + 1)) - 1;
        }
        return s;
    }  //}}}

    T query(int l, int r) {  //{{{  [l, r)
        if (l > r - 1) return 0;
        return _rsum(r - 1) - _rsum(l - 1);
    }  //}}}

    void add(int i, T x) {  //{{{
        raw[i] += x;
        while (i < n) {
            dat[i] += x;
            i |= i + 1;
        }
    }  //}}}

    int lower_bound(T x) {  // a[0]+...+a[ret] >= x{{{
        int ret = -1;
        int k = 1;
        while (2 * k <= n) k <<= 1;
        for (; k > 0; k >>= 1) {
            if (ret + k < n && dat[ret + k] < x) {
                x -= dat[ret + k];
                ret += k;
            }
        }
        return ret + 1;
    }  //}}}

#if defined(PCM) || defined(LOCAL)
    friend ostream& operator<<(ostream& os, bit<T>& b) {  //{{{
        os << endl << "  raw:" << b.raw << endl;
        vector<T> acum;
        rep(i, b.n) { acum.pb(b.sum(i)); }
        os << "  acm:" << acum << endl;
        return os;
    }  //}}}
#endif
};     //}}}

int solve() {
    ll n;cin>>n;
    vector<ll> a(n);
    auto z = zipper();
    rep(i, n){
        cin>>a[i];
        z.add_value(a[i]);
    }
    z.build();
    dump(a);

    int V = 200003;
    bit<mint> bl_sum(V);
    bit<mint> bl_cnt(V);
    bit<mint> br_sum(V);
    bit<mint> br_cnt(V);
    bl_cnt.add(z.zip(a[0]), 1);
    bl_sum.add(z.zip(a[0]), a[0]);

    r_rep(i, 2, n){
        br_cnt.add(z.zip(a[i]), 1);
        br_sum.add(z.zip(a[i]), a[i]);
    }

    mint ans = 0;
    rep(i, 1, n-1){
        cerrendl;
        mint l_cnt = bl_cnt.query(z.zip(a[i])+1, V);
        mint r_cnt = br_cnt.query(0, z.zip(a[i]));
        mint l_sum = bl_sum.query(z.zip(a[i])+1, V);
        mint r_sum = br_sum.query(0, z.zip(a[i]));
        dump(i, l_cnt, r_cnt, l_sum, r_sum);
        ans += l_cnt * r_cnt * a[i];
        ans += l_sum * r_cnt;
        ans += l_cnt * r_sum;
        dump(ans);

        bl_cnt.add(z.zip(a[i]), 1);
        bl_sum.add(z.zip(a[i]), a[i]);

        br_cnt.add(z.zip(a[i+1]), -1);
        br_sum.add(z.zip(a[i+1]), -a[i+1]);
    }
    cout << ans << endl;
    return 0; 
}


int main(){/*{{{*/
    solve();

    #if defined(PCM) || defined(LOCAL)
    check_input();
    #endif

    return 0;
}/*}}}*/
0