結果
問題 | No.1300 Sum of Inversions |
ユーザー | theory_and_me |
提出日時 | 2020-11-27 22:35:54 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 220 ms / 2,000 ms |
コード長 | 5,907 bytes |
コンパイル時間 | 2,272 ms |
コンパイル使用メモリ | 211,160 KB |
実行使用メモリ | 18,156 KB |
最終ジャッジ日時 | 2023-10-09 20:38:29 |
合計ジャッジ時間 | 8,877 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 164 ms
15,536 KB |
testcase_04 | AC | 156 ms
15,180 KB |
testcase_05 | AC | 127 ms
11,996 KB |
testcase_06 | AC | 183 ms
16,604 KB |
testcase_07 | AC | 185 ms
16,264 KB |
testcase_08 | AC | 203 ms
17,012 KB |
testcase_09 | AC | 193 ms
17,000 KB |
testcase_10 | AC | 107 ms
10,908 KB |
testcase_11 | AC | 111 ms
10,804 KB |
testcase_12 | AC | 161 ms
15,584 KB |
testcase_13 | AC | 154 ms
15,184 KB |
testcase_14 | AC | 209 ms
17,776 KB |
testcase_15 | AC | 193 ms
16,980 KB |
testcase_16 | AC | 170 ms
15,848 KB |
testcase_17 | AC | 103 ms
10,532 KB |
testcase_18 | AC | 119 ms
11,340 KB |
testcase_19 | AC | 150 ms
14,356 KB |
testcase_20 | AC | 142 ms
14,832 KB |
testcase_21 | AC | 142 ms
14,504 KB |
testcase_22 | AC | 135 ms
11,840 KB |
testcase_23 | AC | 190 ms
16,600 KB |
testcase_24 | AC | 135 ms
11,964 KB |
testcase_25 | AC | 116 ms
11,220 KB |
testcase_26 | AC | 117 ms
11,052 KB |
testcase_27 | AC | 131 ms
11,704 KB |
testcase_28 | AC | 220 ms
17,380 KB |
testcase_29 | AC | 151 ms
14,364 KB |
testcase_30 | AC | 213 ms
16,992 KB |
testcase_31 | AC | 134 ms
12,016 KB |
testcase_32 | AC | 132 ms
11,984 KB |
testcase_33 | AC | 110 ms
18,124 KB |
testcase_34 | AC | 121 ms
18,136 KB |
testcase_35 | AC | 120 ms
18,024 KB |
testcase_36 | AC | 122 ms
18,156 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); } using S = ll; S op(S a, S b) { return a+b; } S e() { return 0; } int main(){ ll N; cin >> N; V<ll> X(N); REP(i, N) cin >> X[i]; auto get_ma = [](V<ll> &A){ ll N = A.size(); V<ll> ids(N); iota(ALL(ids), 0); sort(ALL(ids), [&](ll x, ll y){ return A[x] > A[y]; }); V<ll> init(N, 0); segtree<S, op, e> seg(init); V<ll> res(N, 0); REP(i, N){ ll j = i; while(j < N and A[ids[i]] == A[ids[j]]){ res[ids[j]] = seg.prod(0, ids[j]); j++; } for(ll k=i;k<j;k++) seg.set(ids[k], 1); i = j -1; } return res; }; auto get_sum = [](V<ll> &A){ ll N = A.size(); V<ll> ids(N); iota(ALL(ids), 0); sort(ALL(ids), [&](ll x, ll y){ return A[x] > A[y]; }); V<ll> init(N, 0); segtree<S, op, e> seg(init); V<ll> res(N, 0); REP(i, N){ ll j = i; while(j < N and A[ids[i]] == A[ids[j]]){ res[ids[j]] = seg.prod(0, ids[j]); j++; } for(ll k=i;k<j;k++) seg.set(ids[k], A[ids[k]]); i = j -1; } return res; }; V<ll> A = get_ma(X); V<ll> B = get_sum(X); REP(i, N) X[i] *= -1; reverse(ALL(X)); V<ll> C = get_ma(X); V<ll> D = get_sum(X); REP(i, N) D[i] *= -1; reverse(ALL(C)); reverse(ALL(D)); // dump(A) // dump(B) // dump(C) // dump(D) REP(i, N) X[i] *= -1; reverse(ALL(X)); mint res = 0; REP(i, N){ res += mint(A[i]) * C[i] * X[i]; res += mint(A[i]) * D[i] ; res += mint(B[i]) * C[i] ; } cout << res << endl; return 0; }