結果

問題 No.2488 Mod Sum Maximization
ユーザー 👑 emthrmemthrm
提出日時 2023-09-30 00:15:31
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 263 ms / 2,000 ms
コード長 4,820 bytes
コンパイル時間 3,062 ms
コンパイル使用メモリ 251,604 KB
実行使用メモリ 28,544 KB
最終ジャッジ日時 2024-07-22 18:13:13
合計ジャッジ時間 9,153 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 7 ms
13,392 KB
testcase_03 AC 250 ms
28,492 KB
testcase_04 AC 244 ms
28,544 KB
testcase_05 AC 244 ms
28,544 KB
testcase_06 AC 235 ms
28,384 KB
testcase_07 AC 176 ms
28,116 KB
testcase_08 AC 236 ms
28,416 KB
testcase_09 AC 182 ms
28,288 KB
testcase_10 AC 142 ms
27,912 KB
testcase_11 AC 19 ms
27,316 KB
testcase_12 AC 129 ms
27,848 KB
testcase_13 AC 112 ms
27,772 KB
testcase_14 AC 36 ms
27,392 KB
testcase_15 AC 185 ms
27,944 KB
testcase_16 AC 21 ms
27,392 KB
testcase_17 AC 58 ms
27,572 KB
testcase_18 AC 27 ms
27,392 KB
testcase_19 AC 199 ms
28,232 KB
testcase_20 AC 217 ms
28,288 KB
testcase_21 AC 208 ms
28,288 KB
testcase_22 AC 232 ms
28,436 KB
testcase_23 AC 246 ms
28,416 KB
testcase_24 AC 100 ms
27,776 KB
testcase_25 AC 17 ms
27,344 KB
testcase_26 AC 22 ms
27,380 KB
testcase_27 AC 156 ms
28,028 KB
testcase_28 AC 159 ms
27,904 KB
testcase_29 AC 147 ms
27,904 KB
testcase_30 AC 100 ms
27,648 KB
testcase_31 AC 30 ms
27,520 KB
testcase_32 AC 231 ms
28,288 KB
testcase_33 AC 12 ms
27,264 KB
testcase_34 AC 263 ms
28,416 KB
testcase_35 AC 91 ms
27,772 KB
testcase_36 AC 5 ms
8,816 KB
testcase_37 AC 6 ms
13,696 KB
testcase_38 AC 6 ms
13,608 KB
testcase_39 AC 6 ms
13,568 KB
testcase_40 AC 7 ms
13,556 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <typename T>
requires requires {
  typename T::Monoid;
  {T::id()} -> std::same_as<typename T::Monoid>;
  {T::merge(std::declval<typename T::Monoid>(),
            std::declval<typename T::Monoid>())}
      -> std::same_as<typename T::Monoid>;
}
struct SegmentTree {
  using Monoid = typename T::Monoid;

  explicit SegmentTree(const int n)
      : SegmentTree(std::vector<Monoid>(n, T::id())) {}

  explicit SegmentTree(const std::vector<Monoid>& a)
      : n(a.size()), p2(std::bit_ceil(a.size())) {
    dat.assign(p2 << 1, T::id());
    std::copy(a.begin(), a.end(), dat.begin() + p2);
    for (int i = p2 - 1; i > 0; --i) {
      dat[i] = T::merge(dat[i << 1], dat[(i << 1) + 1]);
    }
  }

  void set(int idx, const Monoid val) {
    idx += p2;
    dat[idx] = val;
    while (idx >>= 1) dat[idx] = T::merge(dat[idx << 1], dat[(idx << 1) + 1]);
  }

  Monoid get(int left, int right) const {
    Monoid res_l = T::id(), res_r = T::id();
    for (left += p2, right += p2; left < right; left >>= 1, right >>= 1) {
      if (left & 1) res_l = T::merge(res_l, dat[left++]);
      if (right & 1) res_r = T::merge(dat[--right], res_r);
    }
    return T::merge(res_l, res_r);
  }

  Monoid operator[](const int idx) const { return dat[idx + p2]; }

  template <typename G>
  int find_right(int left, const G g) const {
    if (left >= n) [[unlikely]] return n;
    Monoid val = T::id();
    left += p2;
    do {
      while (!(left & 1)) left >>= 1;
      Monoid nxt = T::merge(val, dat[left]);
      if (!g(nxt)) {
        while (left < p2) {
          left <<= 1;
          nxt = T::merge(val, dat[left]);
          if (g(nxt)) {
            val = nxt;
            ++left;
          }
        }
        return left - p2;
      }
      val = nxt;
      ++left;
    } while (!std::has_single_bit(static_cast<unsigned int>(left)));
    return n;
  }

  template <typename G>
  int find_left(int right, const G g) const {
    if (right <= 0) [[unlikely]] return -1;
    Monoid val = T::id();
    right += p2;
    do {
      --right;
      while (right > 1 && (right & 1)) right >>= 1;
      Monoid nxt = T::merge(dat[right], val);
      if (!g(nxt)) {
        while (right < p2) {
          right = (right << 1) + 1;
          nxt = T::merge(dat[right], val);
          if (g(nxt)) {
            val = nxt;
            --right;
          }
        }
        return right - p2;
      }
      val = nxt;
    } while (!std::has_single_bit(static_cast<unsigned int>(right)));
    return -1;
  }

 private:
  const int n, p2;
  std::vector<Monoid> dat;
};

namespace monoid {

template <typename T>
struct RangeMinimumQuery {
  using Monoid = T;
  static constexpr Monoid id() { return std::numeric_limits<Monoid>::max(); }
  static Monoid merge(const Monoid& a, const Monoid& b) {
    return std::min(a, b);
  }
};

template <typename T>
struct RangeMaximumQuery {
  using Monoid = T;
  static constexpr Monoid id() { return std::numeric_limits<Monoid>::lowest(); }
  static Monoid merge(const Monoid& a, const Monoid& b) {
    return std::max(a, b);
  }
};

template <typename T>
struct RangeSumQuery {
  using Monoid = T;
  static constexpr Monoid id() { return 0; }
  static Monoid merge(const Monoid& a, const Monoid& b) { return a + b; }
};

}  // namespace monoid

int main() {
  int n; cin >> n;
  vector<int> a(n); REP(i, n) cin >> a[i];
  SegmentTree<monoid::RangeMinimumQuery<ll>> dp(a.back() + 1);
  dp.set(a.back(), 0);
  for (int i = n - 2; i >= 0; --i) {
    ll dp_ai = LINF;
    for (int d = 1; ; ++d) {
      const ll tmp = dp.get(a[i] * d, min(a[i] * (d + 1), a.back() + 1));
      if (tmp != monoid::RangeMinimumQuery<ll>::id()) {
        chmin(dp_ai, tmp + 1LL * d * a[i]);
      }
      if (a[i] * (d + 1) > a.back()) break;
    }
    dp.set(a[i], dp_ai);
  }
  // REP(i, a.back() + 1) cout << (dp[i] == monoid::RangeMinimumQuery<ll>::id() ? -1 : dp[i]) << " \n"[i == a.back()];
  cout << reduce(a.begin(), a.end(), 0LL) - dp[a.front()] << '\n';
  return 0;
}
0