結果
問題 | No.1300 Sum of Inversions |
ユーザー | firiexp |
提出日時 | 2020-11-27 21:47:20 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 158 ms / 2,000 ms |
コード長 | 3,634 bytes |
コンパイル時間 | 1,543 ms |
コンパイル使用メモリ | 112,104 KB |
実行使用メモリ | 10,344 KB |
最終ジャッジ日時 | 2023-10-01 05:16:41 |
合計ジャッジ時間 | 6,831 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 117 ms
8,656 KB |
testcase_04 | AC | 115 ms
8,500 KB |
testcase_05 | AC | 93 ms
7,604 KB |
testcase_06 | AC | 133 ms
9,208 KB |
testcase_07 | AC | 128 ms
8,908 KB |
testcase_08 | AC | 143 ms
9,492 KB |
testcase_09 | AC | 139 ms
9,472 KB |
testcase_10 | AC | 74 ms
7,040 KB |
testcase_11 | AC | 75 ms
6,904 KB |
testcase_12 | AC | 117 ms
8,464 KB |
testcase_13 | AC | 113 ms
8,392 KB |
testcase_14 | AC | 158 ms
10,072 KB |
testcase_15 | AC | 142 ms
9,432 KB |
testcase_16 | AC | 122 ms
8,628 KB |
testcase_17 | AC | 72 ms
6,604 KB |
testcase_18 | AC | 85 ms
7,108 KB |
testcase_19 | AC | 102 ms
7,968 KB |
testcase_20 | AC | 105 ms
8,028 KB |
testcase_21 | AC | 104 ms
8,016 KB |
testcase_22 | AC | 92 ms
7,708 KB |
testcase_23 | AC | 133 ms
9,172 KB |
testcase_24 | AC | 97 ms
7,628 KB |
testcase_25 | AC | 80 ms
7,312 KB |
testcase_26 | AC | 79 ms
7,108 KB |
testcase_27 | AC | 90 ms
7,308 KB |
testcase_28 | AC | 149 ms
9,636 KB |
testcase_29 | AC | 104 ms
8,300 KB |
testcase_30 | AC | 143 ms
9,552 KB |
testcase_31 | AC | 92 ms
7,684 KB |
testcase_32 | AC | 98 ms
7,640 KB |
testcase_33 | AC | 70 ms
10,344 KB |
testcase_34 | AC | 83 ms
10,164 KB |
testcase_35 | AC | 89 ms
10,280 KB |
testcase_36 | AC | 95 ms
10,204 KB |
ソースコード
#include <iostream> #include <algorithm> #include <map> #include <set> #include <queue> #include <stack> #include <numeric> #include <bitset> #include <cmath> static const int MOD = 998244353; using ll = long long; using u32 = unsigned; using u64 = unsigned long long; using namespace std; template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208; template <u32 M> struct modint { u32 val; public: static modint raw(int v) { modint x; x.val = v; return x; } modint() : val(0) {} template <class T> modint(T v) { ll x = (ll)(v%(ll)(M)); if (x < 0) x += M; val = u32(x); } modint(bool v) { val = ((unsigned int)(v) % M); } modint& operator++() { val++; if (val == M) val = 0; return *this; } modint& operator--() { if (val == 0) val = M; val--; return *this; } modint operator++(int) { modint result = *this; ++*this; return result; } modint operator--(int) { modint result = *this; --*this; return result; } modint& operator+=(const modint& b) { val += b.val; if (val >= M) val -= M; return *this; } modint& operator-=(const modint& b) { val -= b.val; if (val >= M) val += M; return *this; } modint& operator*=(const modint& b) { u64 z = val; z *= b.val; val = (u32)(z % M); return *this; } modint& operator/=(const modint& b) { return *this = *this * b.inv(); } modint operator+() const { return *this; } modint operator-() const { return modint() - *this; } modint pow(long long n) const { modint x = *this, r = 1; while (n) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } modint inv() const { return pow(M-2); } friend modint operator+(const modint& a, const modint& b) { return modint(a) += b; } friend modint operator-(const modint& a, const modint& b) { return modint(a) -= b; } friend modint operator*(const modint& a, const modint& b) { return modint(a) *= b; } friend modint operator/(const modint& a, const modint& b) { return modint(a) /= b; } friend bool operator==(const modint& a, const modint& b) { return a.val == b.val; } friend bool operator!=(const modint& a, const modint& b) { return a.val != b.val; } }; using mint = modint<MOD>; template<class T> class BIT { vector<T> bit; int n, m; public: BIT(int n): n(n), bit(n){ m = 1; while(m < n) m <<= 1; } T sum(int k){ T ret = 0; for (; k > 0; k -= (k & -k)) ret += bit[k-1]; return ret; } void add(int k, T x){ for (k++; k <= bit.size(); k += (k & -k)) bit[k-1] += x; } T lower_bound(T x){ int i = -1; for (int j = m; j; j >>= 1) { if(i+j < bit.size() && bit[i+j] < x) x -= bit[i += j]; } return i; } }; int main() { int n; cin >> n; vector<int> v(n); for (auto &&i : v) scanf("%d", &i); vector<int> z(v); sort(z.begin(), z.end()); z.erase(unique(z.begin(), z.end()), z.end()); auto f = [&](int x){ return lower_bound(z.begin(),z.end(), x) - z.begin(); }; BIT<mint> S(n), T(n); vector<mint> lval(n), rval(n), lcnt(n), rcnt(n); for (int i = 0; i < n; ++i) { int cur = f(v[i]); lval[i] = S.sum(n)-S.sum(cur+1); lcnt[i] = T.sum(n)-T.sum(cur+1); S.add(cur, v[i]); T.add(cur, 1); } S = BIT<mint>(n), T = BIT<mint>(n); mint ans = 0; for (int i = n-1; i >= 0; --i) { int cur = f(v[i]); rval[i] = S.sum(cur); rcnt[i] = T.sum(cur); S.add(cur, v[i]); T.add(cur, 1); ans += v[i]*lcnt[i]*rcnt[i] + lval[i]*rcnt[i] + rval[i]*lcnt[i]; } cout << ans.val << "\n"; return 0; }