結果
問題 | No.1300 Sum of Inversions |
ユーザー | theory_and_me |
提出日時 | 2020-11-28 12:25:28 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 509 ms / 2,000 ms |
コード長 | 5,575 bytes |
コンパイル時間 | 3,293 ms |
コンパイル使用メモリ | 220,156 KB |
実行使用メモリ | 42,588 KB |
最終ジャッジ日時 | 2023-10-09 23:51:34 |
合計ジャッジ時間 | 14,910 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,352 KB |
testcase_01 | AC | 1 ms
4,352 KB |
testcase_02 | AC | 1 ms
4,352 KB |
testcase_03 | AC | 381 ms
36,596 KB |
testcase_04 | AC | 338 ms
36,224 KB |
testcase_05 | AC | 279 ms
25,468 KB |
testcase_06 | AC | 408 ms
39,512 KB |
testcase_07 | AC | 401 ms
38,444 KB |
testcase_08 | AC | 459 ms
39,868 KB |
testcase_09 | AC | 448 ms
39,560 KB |
testcase_10 | AC | 226 ms
23,352 KB |
testcase_11 | AC | 227 ms
23,400 KB |
testcase_12 | AC | 366 ms
35,780 KB |
testcase_13 | AC | 346 ms
36,156 KB |
testcase_14 | AC | 509 ms
42,200 KB |
testcase_15 | AC | 465 ms
39,312 KB |
testcase_16 | AC | 375 ms
37,168 KB |
testcase_17 | AC | 208 ms
22,740 KB |
testcase_18 | AC | 235 ms
23,904 KB |
testcase_19 | AC | 290 ms
34,288 KB |
testcase_20 | AC | 311 ms
34,792 KB |
testcase_21 | AC | 317 ms
34,764 KB |
testcase_22 | AC | 277 ms
25,344 KB |
testcase_23 | AC | 431 ms
39,360 KB |
testcase_24 | AC | 280 ms
26,160 KB |
testcase_25 | AC | 231 ms
23,556 KB |
testcase_26 | AC | 228 ms
23,324 KB |
testcase_27 | AC | 264 ms
24,988 KB |
testcase_28 | AC | 458 ms
40,380 KB |
testcase_29 | AC | 302 ms
34,348 KB |
testcase_30 | AC | 446 ms
39,496 KB |
testcase_31 | AC | 270 ms
25,600 KB |
testcase_32 | AC | 292 ms
26,348 KB |
testcase_33 | AC | 85 ms
27,092 KB |
testcase_34 | AC | 93 ms
27,180 KB |
testcase_35 | AC | 222 ms
42,580 KB |
testcase_36 | AC | 226 ms
42,588 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/segtree> using namespace std; using namespace atcoder; #define REP(i,n) for(ll i=0;i<(ll)n;i++) #define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n"; #define spa << " " << #define fi first #define se second #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() using ld = long double; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<ld, ld>; template<typename T> using V = vector<T>; template<typename T> using P = pair<T, T>; template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); } template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); } template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;} template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; } template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;} struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());} template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } void fail() { cout << -1 << '\n'; exit(0); } inline int popcount(const int x) { return __builtin_popcount(x); } inline int popcount(const ll x) { return __builtin_popcountll(x); } template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++) {cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}}; template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0]; for(ll i=1;i<n;i++)cerr spa v[i]; cerr<<"\n";}; const ll INF = (1ll<<62); // const ld EPS = 1e-10; // const ld PI = acos(-1.0); // const ll mod = (int)1e9 + 7; const ll mod = 998244353; template <std::uint_fast64_t Modulus> class modint { // long long から modint を作るときは必ず正の数にしてからコンストラクタに入れること! // そうしないとバグります using u64 = std::uint_fast64_t; public: u64 a; constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {} constexpr u64 &value() noexcept { return a; } constexpr const u64 &value() const noexcept { return a; } constexpr modint operator+(const modint rhs) const noexcept { return modint(*this) += rhs; } constexpr modint operator-(const modint rhs) const noexcept { return modint(*this) -= rhs; } constexpr modint operator*(const modint rhs) const noexcept { return modint(*this) *= rhs; } constexpr modint operator/(const modint rhs) const noexcept { return modint(*this) /= rhs; } constexpr modint &operator+=(const modint rhs) noexcept { a += rhs.a; if (a >= Modulus) { a -= Modulus; } return *this; } constexpr modint &operator-=(const modint rhs) noexcept { if (a < rhs.a) { a += Modulus; } a -= rhs.a; return *this; } constexpr modint &operator*=(const modint rhs) noexcept { a = a * rhs.a % Modulus; return *this; } constexpr modint &operator/=(modint rhs) noexcept { u64 exp = Modulus - 2; while (exp) { if (exp % 2) { *this *= rhs; } rhs *= rhs; exp /= 2; } return *this; } }; using mint = modint<mod>; using vm = vector<mint>; using vvm = vector<vm>; ostream& operator << (ostream& os, const mint v){ os << v.value(); return os; } template <class T, class U> constexpr T power(T x, U exp) { T ret = static_cast<T>(1); while (exp) { if (exp % static_cast<U>(2) == static_cast<U>(1)) ret *= x; exp /= static_cast<U>(2); x *= x; } return ::std::move(ret); } template<typename T> tuple<map<T, int>, vector<T>> compress(const vector<T> &X){ vector<T> decoder = X; sort(decoder.begin(), decoder.end()); decoder.erase(unique(decoder.begin(), decoder.end()), decoder.end()); map<T, int> encoder; for(int i=0;i<(int)decoder.size();i++) encoder[decoder[i]] = i; return {encoder, decoder}; } ll op(ll x, ll y){ return x+y; } ll e(){ return 0; } int main(){ ll N; cin >> N; V<ll> A(N); REP(i, N) cin >> A[i]; auto [enc, dec] = compress(A); segtree<ll, op, e> seg_L_cnt(N), seg_L_sum(N), seg_R_cnt(N), seg_R_sum(N); V<ll> L_cnt(N), L_sum(N), R_cnt(N), R_sum(N); REP(i, N){ ll v = enc[A[i]]; L_cnt[i] = seg_L_cnt.prod(v+1, N); L_sum[i] = seg_L_sum.prod(v+1, N); ll val = seg_L_cnt.get(v); seg_L_cnt.set(v, val+1); val = seg_L_sum.get(v); seg_L_sum.set(v, val+A[i]); } for(ll i=N-1;i>=0;i--){ ll v = enc[A[i]]; R_cnt[i] = seg_R_cnt.prod(0, v); R_sum[i] = seg_R_sum.prod(0, v); ll val = seg_R_cnt.get(v); seg_R_cnt.set(v, val+1); val = seg_R_sum.get(v); seg_R_sum.set(v, val+A[i]); } // dump(L_cnt) // dump(L_sum) // dump(R_cnt) // dump(R_sum) mint res = 0; REP(i, N){ res += mint(A[i]) * L_cnt[i] * R_cnt[i]; res += mint(L_cnt[i]) * R_sum[i]; res += mint(R_cnt[i]) * L_sum[i]; } cout << res << endl; return 0; }