結果
問題 | No.2488 Mod Sum Maximization |
ユーザー | 👑 emthrm |
提出日時 | 2023-09-30 00:15:31 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 232 ms / 2,000 ms |
コード長 | 4,820 bytes |
コンパイル時間 | 3,946 ms |
コンパイル使用メモリ | 250,336 KB |
実行使用メモリ | 28,724 KB |
最終ジャッジ日時 | 2023-09-30 00:15:43 |
合計ジャッジ時間 | 9,593 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 7 ms
13,304 KB |
testcase_03 | AC | 196 ms
28,516 KB |
testcase_04 | AC | 232 ms
28,724 KB |
testcase_05 | AC | 203 ms
28,268 KB |
testcase_06 | AC | 183 ms
28,304 KB |
testcase_07 | AC | 137 ms
28,068 KB |
testcase_08 | AC | 187 ms
28,504 KB |
testcase_09 | AC | 174 ms
27,972 KB |
testcase_10 | AC | 112 ms
27,912 KB |
testcase_11 | AC | 15 ms
27,208 KB |
testcase_12 | AC | 114 ms
27,608 KB |
testcase_13 | AC | 93 ms
27,768 KB |
testcase_14 | AC | 30 ms
27,148 KB |
testcase_15 | AC | 121 ms
27,864 KB |
testcase_16 | AC | 19 ms
27,192 KB |
testcase_17 | AC | 46 ms
27,364 KB |
testcase_18 | AC | 21 ms
27,524 KB |
testcase_19 | AC | 163 ms
28,216 KB |
testcase_20 | AC | 179 ms
28,400 KB |
testcase_21 | AC | 175 ms
28,284 KB |
testcase_22 | AC | 186 ms
28,372 KB |
testcase_23 | AC | 192 ms
28,348 KB |
testcase_24 | AC | 78 ms
27,600 KB |
testcase_25 | AC | 14 ms
27,084 KB |
testcase_26 | AC | 25 ms
27,180 KB |
testcase_27 | AC | 126 ms
28,044 KB |
testcase_28 | AC | 132 ms
27,996 KB |
testcase_29 | AC | 122 ms
27,704 KB |
testcase_30 | AC | 87 ms
27,600 KB |
testcase_31 | AC | 25 ms
27,452 KB |
testcase_32 | AC | 194 ms
28,124 KB |
testcase_33 | AC | 11 ms
27,252 KB |
testcase_34 | AC | 224 ms
28,516 KB |
testcase_35 | AC | 79 ms
27,728 KB |
testcase_36 | AC | 4 ms
8,676 KB |
testcase_37 | AC | 6 ms
13,556 KB |
testcase_38 | AC | 5 ms
13,644 KB |
testcase_39 | AC | 6 ms
13,568 KB |
testcase_40 | AC | 6 ms
13,608 KB |
ソースコード
#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; }