結果
問題 | No.2659 Manga App |
ユーザー |
![]() |
提出日時 | 2024-03-01 01:38:41 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 696 ms / 6,000 ms |
コード長 | 3,533 bytes |
コンパイル時間 | 5,210 ms |
コンパイル使用メモリ | 321,836 KB |
実行使用メモリ | 174,080 KB |
最終ジャッジ日時 | 2024-09-29 13:23:54 |
合計ジャッジ時間 | 10,646 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 46 |
ソースコード
#include <atcoder/all>#include <bits/stdc++.h>using ll = long long;using ull = unsigned long long;#define rep(i, n) for(int i = 0; i < (int)(n); i++)#define REP(i, m, n) for(int i = (int)(m); i < (int)(n); i++)using namespace std;using namespace atcoder;using mint = modint998244353;const int inf = 1000000007;const ll longinf = 1ll << 60;namespace modint_util {vector<mint> fact, invfact, inv;void init(int n = 1 << 20) {fact.assign(n + 1, 0);invfact.assign(n + 1, 0);inv.assign(n + 1, 0);fact[0] = 1;rep(i, n) fact[i + 1] = fact[i] * (i + 1);invfact[n] = fact[n].inv();rep(i, n) invfact[n - i - 1] = invfact[n - i] * (n - i);rep(i, n) inv[i + 1] = invfact[i + 1] * fact[i];}vector<mint> power_list(int n, mint v) {vector<mint> a(n);a[0] = 1;rep(i, n - 1) a[i + 1] = a[i] * v;return a;}mint comb(int n, int k) {if(k < 0 || k > n || n < 0) {return 0;}return fact[n] * fact[n - k] * fact[k];}}; // namespace modint_utilnamespace fp = modint_util;int main() {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);int n;cin >> n;ll b, c, x;cin >> b >> c >> x;ll d = b + c;vector<ll> a(n - 1);rep(i, n - 1) cin >> a[i];vector<unordered_map<ll, ll>> dps(n), dpe(n);dps[0][0] = x;ll ans = longinf;rep(i, n - 1) {{int k = i;ll t = 0;while(k < n - 1) {t += a[k++];if(t % d > b) {break;}}if(k == n - 1) {for(auto [ct, cx] : dps[i]) {ll ret = max(ct + t - cx, 0ll);if(ret % d > b) {ret = (ret + d - 1) / d * d;}ans = min(ans, ret);}} else {ll s = (t + d - 1) / d * d;ll e = t / d * d + b;ll need = t - e;for(auto [ct, cx] : dps[i]) {dps[k][ct + s] = max(dps[k][ct + s], cx);}for(auto [ct, cx] : dps[i]) {if(cx < need) {continue;}dpe[k][ct + e] = max(dpe[k][ct + e], cx - need);}}}{int k = i;ll t = b;while(k < n - 1) {t += a[k++];if(t % d > b) {break;}}if(k == n - 1) {t -= b;for(auto [ct, cx] : dpe[i]) {ll ret = max(ct + t - cx, 0ll);if(ret % d > b) {ret = (ret + d - 1) / d * d;}ans = min(ans, ret);}} else {ll s = (t + d - 1) / d * d;ll e = t / d * d + b;ll need = t - e;s -= b;e -= b;for(auto [ct, cx] : dpe[i]) {dps[k][ct + s] = max(dps[k][ct + s], cx);}for(auto [ct, cx] : dpe[i]) {if(cx < need) {continue;}dpe[k][ct + e] = max(dpe[k][ct + e], cx - need);}}}}cout << ans << endl;return 0;}