結果

問題 No.2488 Mod Sum Maximization
ユーザー 👑 hos.lyrichos.lyric
提出日時 2023-09-30 01:05:20
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 262 ms / 2,000 ms
コード長 6,610 bytes
コンパイル時間 1,146 ms
コンパイル使用メモリ 108,216 KB
実行使用メモリ 24,448 KB
最終ジャッジ日時 2024-07-22 19:01:48
合計ジャッジ時間 7,421 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 6 ms
11,520 KB
testcase_03 AC 241 ms
24,400 KB
testcase_04 AC 238 ms
24,448 KB
testcase_05 AC 235 ms
24,416 KB
testcase_06 AC 224 ms
24,108 KB
testcase_07 AC 164 ms
22,888 KB
testcase_08 AC 226 ms
24,192 KB
testcase_09 AC 176 ms
23,168 KB
testcase_10 AC 134 ms
22,320 KB
testcase_11 AC 17 ms
19,840 KB
testcase_12 AC 127 ms
22,032 KB
testcase_13 AC 105 ms
21,632 KB
testcase_14 AC 34 ms
20,160 KB
testcase_15 AC 147 ms
22,444 KB
testcase_16 AC 20 ms
19,840 KB
testcase_17 AC 55 ms
20,660 KB
testcase_18 AC 25 ms
19,968 KB
testcase_19 AC 194 ms
23,528 KB
testcase_20 AC 205 ms
23,868 KB
testcase_21 AC 202 ms
23,680 KB
testcase_22 AC 225 ms
24,192 KB
testcase_23 AC 232 ms
24,320 KB
testcase_24 AC 93 ms
21,484 KB
testcase_25 AC 15 ms
19,816 KB
testcase_26 AC 21 ms
19,924 KB
testcase_27 AC 153 ms
22,144 KB
testcase_28 AC 160 ms
22,184 KB
testcase_29 AC 145 ms
22,052 KB
testcase_30 AC 100 ms
21,176 KB
testcase_31 AC 30 ms
20,028 KB
testcase_32 AC 224 ms
23,424 KB
testcase_33 AC 11 ms
19,712 KB
testcase_34 AC 262 ms
24,220 KB
testcase_35 AC 96 ms
21,120 KB
testcase_36 AC 4 ms
7,472 KB
testcase_37 AC 6 ms
11,532 KB
testcase_38 AC 6 ms
11,512 KB
testcase_39 AC 6 ms
11,516 KB
testcase_40 AC 5 ms
11,544 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreePoint {
  int logN, n;
  vector<T> ts;
  SegmentTreePoint() : logN(0), n(0) {}
  explicit SegmentTreePoint(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreePoint(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Changes the value of point a to s.
  template <class S> void change(int a, const S &s) {
    assert(0 <= a); assert(a < n);
    ts[a += n] = T(s);
    for (; a >>= 1; ) pull(a);
  }

  // Applies T::f(args...) to point a.
  template <class F, class... Args>
  void ch(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a < n);
    (ts[a += n].*f)(args...);
    for (; a >>= 1; ) pull(a);
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    a += n; b += n;
    T prodL, prodR, t;
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) { t.pull(prodL, ts[aa++]); prodL = t; }
      if (bb & 1) { t.pull(ts[--bb], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    a += n; b += n;
    auto prodL = e(), prodR = e();
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) prodL = op(prodL, (ts[aa++].*f)(args...));
      if (bb & 1) prodR = op((ts[--bb].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};

////////////////////////////////////////////////////////////////////////////////

constexpr Int INF = 1001001001001001001LL;

struct NodeMin {
  Int mn;
  NodeMin() : mn(+INF) {}
  NodeMin(Int val) : mn(val) {}
  void pull(const NodeMin &l, const NodeMin &r) {
    mn = min(l.mn, r.mn);
  }
  void ch(Int val) {
    mn = val;
  }
  void chmin(Int val) {
    if (mn > val) mn = val;
  }
  bool test(Int tar) const {
    return (mn <= tar);
  }
};
struct NodeMax {
  Int mx;
  NodeMax() : mx(-INF) {}
  NodeMax(Int val) : mx(val) {}
  void pull(const NodeMax &l, const NodeMax &r) {
    mx = max(l.mx, r.mx);
  }
  void ch(Int val) {
    mx = val;
  }
  void chmax(Int val) {
    if (mx < val) mx = val;
  }
  bool test(Int tar) const {
    return (mx >= tar);
  }
};

////////////////////////////////////////////////////////////////////////////////


/*
  N-1 = i[0] > i[1] > ... > i[d-1] > i[d] = 0
  others: incr.
  
  score = \sum A[*] + \sum[0<=j<d] (-A[i[j]] + (A[i[j]] mod A[i[j+1]]))
        = \sum A[*] - \sum[0<=j<d] floor(A[i[j]] / A[i[j+1]]) A[i[j+1]]
*/

int N;
vector<Int> A;

int main() {
  for (; ~scanf("%d", &N); ) {
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld", &A[i]);
    }
    
    SegmentTreePoint<NodeMin> seg(A[N - 1] + 1);
    vector<Int> dp(N, INF);
    for (int i = N; --i >= 0; ) {
      if (i == N - 1) {
        dp[i] = 0;
      } else {
        for (Int q = 1; A[i] * q <= A[N - 1]; ++q) {
          const Int res = seg.get(A[i] * q, min(A[i] * (q + 1), A[N - 1] + 1)).mn;
          chmin(dp[i], res + A[i] * q);
        }
      }
      seg.change(A[i], dp[i]);
    }
// cerr<<"dp = "<<dp<<endl;
    
    Int ans = 0;
    for (int i = 0; i < N; ++i) ans += A[i];
    ans -= dp[0];
    printf("%lld\n", ans);
  }
  return 0;
}
0