結果
問題 | No.1300 Sum of Inversions |
ユーザー | apricity |
提出日時 | 2023-02-12 02:23:46 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 400 ms / 2,000 ms |
コード長 | 5,783 bytes |
コンパイル時間 | 1,716 ms |
コンパイル使用メモリ | 145,156 KB |
実行使用メモリ | 39,168 KB |
最終ジャッジ日時 | 2024-07-08 11:33:07 |
合計ジャッジ時間 | 13,503 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
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 | 296 ms
30,976 KB |
testcase_04 | AC | 282 ms
30,336 KB |
testcase_05 | AC | 221 ms
25,472 KB |
testcase_06 | AC | 333 ms
34,304 KB |
testcase_07 | AC | 320 ms
32,896 KB |
testcase_08 | AC | 354 ms
35,968 KB |
testcase_09 | AC | 353 ms
35,840 KB |
testcase_10 | AC | 176 ms
21,888 KB |
testcase_11 | AC | 176 ms
22,016 KB |
testcase_12 | AC | 279 ms
30,336 KB |
testcase_13 | AC | 278 ms
29,696 KB |
testcase_14 | AC | 400 ms
38,656 KB |
testcase_15 | AC | 368 ms
35,584 KB |
testcase_16 | AC | 308 ms
31,616 KB |
testcase_17 | AC | 177 ms
21,248 KB |
testcase_18 | AC | 216 ms
23,808 KB |
testcase_19 | AC | 258 ms
27,392 KB |
testcase_20 | AC | 256 ms
27,904 KB |
testcase_21 | AC | 249 ms
27,776 KB |
testcase_22 | AC | 223 ms
25,600 KB |
testcase_23 | AC | 339 ms
34,048 KB |
testcase_24 | AC | 224 ms
26,368 KB |
testcase_25 | AC | 186 ms
23,296 KB |
testcase_26 | AC | 185 ms
22,912 KB |
testcase_27 | AC | 219 ms
24,960 KB |
testcase_28 | AC | 377 ms
36,608 KB |
testcase_29 | AC | 243 ms
27,520 KB |
testcase_30 | AC | 367 ms
35,712 KB |
testcase_31 | AC | 217 ms
25,856 KB |
testcase_32 | AC | 228 ms
26,624 KB |
testcase_33 | AC | 59 ms
18,180 KB |
testcase_34 | AC | 71 ms
18,176 KB |
testcase_35 | AC | 148 ms
39,168 KB |
testcase_36 | AC | 153 ms
39,168 KB |
ソースコード
#include<iostream> #include<string> #include<vector> #include<algorithm> #include<numeric> #include<cmath> #include<utility> #include<tuple> #include<cstdint> #include<cstdio> #include<iomanip> #include<map> #include<queue> #include<set> #include<stack> #include<deque> #include<unordered_map> #include<unordered_set> #include<bitset> #include<cctype> #include<chrono> #include<random> #include<cassert> #include<cstddef> #include<iterator> #include<string_view> #include<type_traits> #ifdef LOCAL # include "debug_print.hpp" # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast<void>(0)) #endif using namespace std; #define rep(i,n) for(int i=0; i<(n); i++) #define rrep(i,n) for(int i=(n)-1; i>=0; i--) #define FOR(i,a,b) for(int i=(a); i<(b); i++) #define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--) #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); #define pb push_back using ll = long long; using D = double; using LD = long double; using P = pair<int, int>; template<typename T> using PQ = priority_queue<T,vector<T>>; template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>; 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 (b<a) { a=b; return 1; } return 0; } void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";} template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; } template<typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p) { is >> p.first >> p.second; return is; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; } void in() {} template<typename T, class... U> void in(T &t, U &...u) { cin >> t; in(u...); } void out() { cout << "\n"; } template<typename T, class... U, char sep = ' '> void out(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; out(u...); } void outr() {} template<typename T, class... U, char sep = ' '> void outr(const T &t, const U &...u) { cout << t; outr(u...); } template<int mod> struct Fp { long long val; constexpr Fp(long long v = 0) noexcept : val(v % mod) { if (val < 0) val += mod; } constexpr int getmod() { return mod; } constexpr Fp operator - () const noexcept { return val ? mod - val : 0; } constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; } constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; } constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; } constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; } constexpr Fp& operator += (const Fp& r) noexcept { val += r.val; if (val >= mod) val -= mod; return *this; } constexpr Fp& operator -= (const Fp& r) noexcept { val -= r.val; if (val < 0) val += mod; return *this; } constexpr Fp& operator *= (const Fp& r) noexcept { val = val * r.val % mod; return *this; } constexpr Fp& operator /= (const Fp& r) noexcept { long long a = r.val, b = mod, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } val = val * u % mod; if (val < 0) val += mod; return *this; } constexpr bool operator == (const Fp& r) const noexcept { return this->val == r.val; } constexpr bool operator != (const Fp& r) const noexcept { return this->val != r.val; } friend constexpr istream& operator >> (istream &is, const Fp<mod>& x) noexcept { int val; is >> val; x = Fp<mod>(val); return is; } friend constexpr ostream& operator << (ostream &os, const Fp<mod>& x) noexcept { return os << x.val; } friend constexpr Fp<mod> modpow(const Fp<mod> &a, long long n) noexcept { if (n == 0) return 1; auto t = modpow(a, n / 2); t = t * t; if (n & 1) t = t * a; return t; } }; //const int mod = 1e9+7; const int mod = 998244353; using mint = Fp<mod>; #include "atcoder/fenwicktree.hpp" int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; in(n); vector<ll> a(n); in(a); map<ll,vector<int>> mp; rep(i,n){ mp[a[i]].pb(i); } vector<mint> suml(n),sumr(n),cntl(n),cntr(n); atcoder::fenwick_tree<mint> sum(n); atcoder::fenwick_tree<mint> cnt(n); for(auto &[val,vec] : mp){ for(int& idx : vec){ sumr[idx] = sum.sum(idx+1,n); cntr[idx] = cnt.sum(idx+1,n); } for(int& idx : vec){ sum.add(idx, val); cnt.add(idx, 1); } } atcoder::fenwick_tree<mint> sum2(n); atcoder::fenwick_tree<mint> cnt2(n); for(auto it = mp.rbegin(); it != mp.rend(); it++){ auto &[val,vec] = *it; for(int& idx : vec){ suml[idx] = sum2.sum(0,idx); cntl[idx] = cnt2.sum(0,idx); } for(int& idx : vec){ sum2.add(idx, val); cnt2.add(idx, 1); } } mint ans = 0; rep(i,n){ ans += cntl[i] * cntr[i] * a[i]; ans += sumr[i] * cntl[i]; ans += suml[i] * cntr[i]; } out(ans); }