結果
問題 | No.409 ダイエット |
ユーザー | umimel |
提出日時 | 2023-01-31 23:23:38 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,636 bytes |
コンパイル時間 | 1,784 ms |
コンパイル使用メモリ | 175,468 KB |
実行使用メモリ | 7,708 KB |
最終ジャッジ日時 | 2024-06-30 23:43:08 |
合計ジャッジ時間 | 5,335 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | WA | - |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 2 ms
6,944 KB |
testcase_15 | AC | 2 ms
6,940 KB |
testcase_16 | AC | 2 ms
6,944 KB |
testcase_17 | WA | - |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,944 KB |
testcase_21 | AC | 2 ms
6,940 KB |
testcase_22 | WA | - |
testcase_23 | AC | 2 ms
6,944 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 2 ms
6,940 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 2 ms
6,940 KB |
testcase_32 | WA | - |
testcase_33 | AC | 2 ms
6,940 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | AC | 27 ms
7,680 KB |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | AC | 29 ms
7,168 KB |
testcase_66 | WA | - |
testcase_67 | WA | - |
testcase_68 | WA | - |
testcase_69 | WA | - |
testcase_70 | WA | - |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | WA | - |
testcase_75 | WA | - |
testcase_76 | WA | - |
testcase_77 | WA | - |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | WA | - |
testcase_81 | WA | - |
testcase_82 | WA | - |
testcase_83 | WA | - |
testcase_84 | WA | - |
testcase_85 | WA | - |
testcase_86 | WA | - |
testcase_87 | WA | - |
testcase_88 | WA | - |
testcase_89 | AC | 28 ms
6,940 KB |
testcase_90 | AC | 13 ms
6,940 KB |
testcase_91 | AC | 31 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using pll = pair<ll, ll>; #define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i) #define rep(i, n) drep(i, 0, n - 1) #define all(a) (a).begin(), (a).end() #define pb push_back #define fi first #define se second const ll MOD = 1000000007; const ll MOD2 = 998244353; const ll INF = 1LL << 60; const ll MAX_N = 2e5; deque<pll> deq; ll N, A, B, W; bool check(pll f1, pll f2, pll f3){ return (f2.fi-f1.fi)*(f3.se-f2.se) >= (f2.se-f1.se)*(f3.fi-f2.fi); } void add(pll conf2){ while((ll)deq.size()>=2){ pll conf1 = deq.back(); deq.pop_back(); pll conf0 = deq.back(); if(!check(conf0, conf1, conf2)){ deq.push_back(conf1); break; } } deq.push_back(conf2); } ll f(pll coef, ll x){ return (coef.fi*x + coef.se);} ll query(ll x){ while((ll)deq.size()>=2){ pll coef0 = deq.front(); deq.pop_front(); pll coef1 = deq.front(); deq.pop_front(); if(f(coef0, x) >= f(coef1, x)){ deq.push_front(coef1); }else{ deq.push_front(coef1); deq.push_front(coef0); break; } } return f(deq.front(), x); } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); cin >> N >> A >> B >> W; vector<ll> D(N+1); for(ll i=1; i<=N; i++) cin >> D[i]; vector<ll> dp(N+1); dp[0] = W; add({B-2*A, 2*W}); for(ll i=1; i<=N; i++){ dp[i] = (B*i*i+query(i))/2; add({B-2*B*i-2*A, B*i*i-B*i+2*A*i+2*dp[i-1]+2*D[i]}); } cout << dp[N] << endl; }