結果
問題 | No.409 ダイエット |
ユーザー | sugim48 |
提出日時 | 2016-08-05 23:27:33 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,562 bytes |
コンパイル時間 | 1,092 ms |
コンパイル使用メモリ | 107,896 KB |
実行使用メモリ | 15,248 KB |
最終ジャッジ日時 | 2024-11-07 03:15:33 |
合計ジャッジ時間 | 5,368 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
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 | WA | - |
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 | WA | - |
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 | WA | - |
testcase_90 | WA | - |
testcase_91 | WA | - |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:63:21: warning: 'ans' may be used uninitialized [-Wmaybe-uninitialized] 63 | cout << W + ans << endl; | ^~~ main.cpp:44:12: note: 'ans' was declared here 44 | ll ans; | ^~~
ソースコード
#define _USE_MATH_DEFINES #include <algorithm> #include <cstdio> #include <functional> #include <iostream> #include <cfloat> #include <climits> #include <cstdlib> #include <cstring> #include <cmath> #include <map> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <time.h> #include <vector> #include <random> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> i_i; typedef pair<ll, int> ll_i; typedef pair<int, ll> i_ll; typedef pair<double, int> d_i; typedef pair<ll, ll> ll_ll; typedef pair<double, double> d_d; struct edge { int u, v; ll w; }; ll MOD = 1000000007; ll _MOD = 1000000009; double EPS = 1e-10; int main() { int N; ll A, B, W; cin >> N >> A >> B >> W; vector<ll> D(N); for (ll& x: D) scanf("%lld", &x); N++; D.push_back(0); int M = 1; vector<i_ll> p; p.push_back(i_ll(0, 0)); ll ans; for (ll i = 0; i < N; i++) { ll mi = LLONG_MAX; ll lb = 0, ub = M - 1; while (ub - lb > 1) { ll mid = (lb + ub) / 2; ll x1 = p[mid].second - B * i * p[mid].first; ll x2 = p[mid + 1].second - B * i * p[mid + 1].first; if (x1 > x2) lb = mid; else ub = mid; mi = min(mi, min(x1, x2)); } mi += i*(i+1)/2 * B - i * A + D[i]; ans = mi; i_ll _p(i + 1, mi + i*(i+1)/2 * B + (i+1) * A); for (; M >= 2 && (double)(p[M - 1].second - p[M - 2].second) / (p[M - 1].first - p[M - 2].first) >= (double)(_p.second - p[M - 1].second) / (_p.first - p[M - 1].first); M--, p.pop_back()); M++; p.push_back(_p); } cout << W + ans << endl; }