結果
問題 | No.409 ダイエット |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-01-22 23:00:26 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 51 ms / 2,000 ms |
コード長 | 2,802 bytes |
コンパイル時間 | 818 ms |
コンパイル使用メモリ | 109,908 KB |
実行使用メモリ | 17,004 KB |
最終ジャッジ日時 | 2023-09-03 22:53:46 |
合計ジャッジ時間 | 6,876 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,384 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,384 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 1 ms
4,384 KB |
testcase_13 | AC | 1 ms
4,380 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 1 ms
4,384 KB |
testcase_16 | AC | 1 ms
4,376 KB |
testcase_17 | AC | 1 ms
4,376 KB |
testcase_18 | AC | 1 ms
4,380 KB |
testcase_19 | AC | 1 ms
4,380 KB |
testcase_20 | AC | 1 ms
4,380 KB |
testcase_21 | AC | 1 ms
4,380 KB |
testcase_22 | AC | 2 ms
4,384 KB |
testcase_23 | AC | 1 ms
4,376 KB |
testcase_24 | AC | 1 ms
4,376 KB |
testcase_25 | AC | 1 ms
4,376 KB |
testcase_26 | AC | 1 ms
4,380 KB |
testcase_27 | AC | 2 ms
4,376 KB |
testcase_28 | AC | 1 ms
4,380 KB |
testcase_29 | AC | 1 ms
4,384 KB |
testcase_30 | AC | 1 ms
4,380 KB |
testcase_31 | AC | 2 ms
4,380 KB |
testcase_32 | AC | 1 ms
4,380 KB |
testcase_33 | AC | 1 ms
4,376 KB |
testcase_34 | AC | 1 ms
4,380 KB |
testcase_35 | AC | 2 ms
4,376 KB |
testcase_36 | AC | 2 ms
4,376 KB |
testcase_37 | AC | 2 ms
4,380 KB |
testcase_38 | AC | 2 ms
4,376 KB |
testcase_39 | AC | 2 ms
4,380 KB |
testcase_40 | AC | 2 ms
4,384 KB |
testcase_41 | AC | 2 ms
4,380 KB |
testcase_42 | AC | 2 ms
4,376 KB |
testcase_43 | AC | 2 ms
4,376 KB |
testcase_44 | AC | 2 ms
4,380 KB |
testcase_45 | AC | 2 ms
4,384 KB |
testcase_46 | AC | 2 ms
4,376 KB |
testcase_47 | AC | 2 ms
4,376 KB |
testcase_48 | AC | 2 ms
4,380 KB |
testcase_49 | AC | 2 ms
4,384 KB |
testcase_50 | AC | 2 ms
4,380 KB |
testcase_51 | AC | 2 ms
4,384 KB |
testcase_52 | AC | 2 ms
4,376 KB |
testcase_53 | AC | 2 ms
4,380 KB |
testcase_54 | AC | 2 ms
4,380 KB |
testcase_55 | AC | 20 ms
9,764 KB |
testcase_56 | AC | 35 ms
16,196 KB |
testcase_57 | AC | 38 ms
16,736 KB |
testcase_58 | AC | 16 ms
8,632 KB |
testcase_59 | AC | 24 ms
13,036 KB |
testcase_60 | AC | 16 ms
7,988 KB |
testcase_61 | AC | 34 ms
15,876 KB |
testcase_62 | AC | 36 ms
16,888 KB |
testcase_63 | AC | 34 ms
14,996 KB |
testcase_64 | AC | 19 ms
9,664 KB |
testcase_65 | AC | 37 ms
16,400 KB |
testcase_66 | AC | 38 ms
16,208 KB |
testcase_67 | AC | 28 ms
13,884 KB |
testcase_68 | AC | 25 ms
13,276 KB |
testcase_69 | AC | 34 ms
16,440 KB |
testcase_70 | AC | 44 ms
16,936 KB |
testcase_71 | AC | 24 ms
8,824 KB |
testcase_72 | AC | 51 ms
17,004 KB |
testcase_73 | AC | 48 ms
15,128 KB |
testcase_74 | AC | 30 ms
13,168 KB |
testcase_75 | AC | 48 ms
15,592 KB |
testcase_76 | AC | 35 ms
13,884 KB |
testcase_77 | AC | 25 ms
8,880 KB |
testcase_78 | AC | 26 ms
13,128 KB |
testcase_79 | AC | 23 ms
8,692 KB |
testcase_80 | AC | 48 ms
15,700 KB |
testcase_81 | AC | 49 ms
15,596 KB |
testcase_82 | AC | 36 ms
13,976 KB |
testcase_83 | AC | 38 ms
13,484 KB |
testcase_84 | AC | 33 ms
13,056 KB |
testcase_85 | AC | 5 ms
4,384 KB |
testcase_86 | AC | 32 ms
12,892 KB |
testcase_87 | AC | 42 ms
14,828 KB |
testcase_88 | AC | 19 ms
9,068 KB |
testcase_89 | AC | 38 ms
13,828 KB |
testcase_90 | AC | 18 ms
6,720 KB |
testcase_91 | AC | 40 ms
13,812 KB |
ソースコード
import std.conv, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } void chmin(T)(ref T t, in T f) { if (t > f) t = f; } void chmax(T)(ref T t, in T f) { if (t < f) t = f; } int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; } int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); } int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); } /* dp[i] = min{ dp[j] - A (i - j - 1) + B (i - j - 1) (i - j) / 2 + D[i] | 0 <= j < i } = min{ (dp[j] + A j + B j (j + 1) / 2) - (B j) i | 0 <= j < i } - A (i - 1) + B i (i - 1) / 2 + D[i] */ int N; long A, B, W; long[] D; void main() { try { for (; ; ) { N = readInt(); A = readLong(); B = readLong(); W = readLong(); D = new long[N + 2]; foreach (i; 1 .. N + 1) { D[i] = readLong(); } debug { auto dp = new long[N + 2]; dp[0] = W; foreach (i; 1 .. N + 2) { dp[i] = iota(0, i).map!(j => (dp[j] + A * j + B * j * (j + 1) / 2) - (B * j) * i).minElement - A * (i - 1) + B * i * (i - 1) / 2 + D[i]; } writeln(dp); } long ans; auto q = new Tuple!(long, long)[N + 2]; int qHead, qTail; foreach (i; 0 .. N + 2) { long x; if (i == 0) { x = W; } else { for (; qTail - qHead >= 2 && q[qHead][0] - q[qHead][1] * i >= q[qHead + 1][0] - q[qHead + 1][1] * i; ++qHead) {} x = q[qHead][0] - q[qHead][1] * i - A * (i - 1) + B * i * (i - 1) / 2 + D[i]; } debug { writeln(i, " ", x); } if (i == N + 1) { ans = x; } else { const p = Tuple!(long, long)(x + A * i + B * i * (i + 1) / 2, B * i); // ([-1][0] - [-2][0]) / ([-1][1] - [-2][1]) >= (p[0] - [-2][0]) / (p[1] - [-2][1]) for (; qTail - qHead >= 2 && (q[qTail - 1][0] - q[qTail - 2][0]) * (p[1] - q[qTail - 2][1]) >= (p[0] - q[qTail - 2][0]) * (q[qTail - 1][1] - q[qTail - 2][1]); --qTail) {} q[qTail++] = p; } } writeln(ans); } } catch (EOFException e) { } }