結果
問題 | No.2139 K Consecutive Sushi |
ユーザー | 👑 hos.lyric |
提出日時 | 2022-12-03 00:04:35 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 54 ms / 2,000 ms |
コード長 | 3,042 bytes |
コンパイル時間 | 3,302 ms |
コンパイル使用メモリ | 121,600 KB |
実行使用メモリ | 17,552 KB |
最終ジャッジ日時 | 2024-05-05 19:21:07 |
合計ジャッジ時間 | 3,935 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 45 ms
17,552 KB |
testcase_04 | AC | 47 ms
17,424 KB |
testcase_05 | AC | 46 ms
17,552 KB |
testcase_06 | AC | 47 ms
17,552 KB |
testcase_07 | AC | 46 ms
17,548 KB |
testcase_08 | AC | 47 ms
17,420 KB |
testcase_09 | AC | 45 ms
17,552 KB |
testcase_10 | AC | 54 ms
17,548 KB |
testcase_11 | AC | 44 ms
17,552 KB |
testcase_12 | AC | 45 ms
17,552 KB |
testcase_13 | AC | 1 ms
5,376 KB |
testcase_14 | AC | 1 ms
5,376 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 1 ms
5,376 KB |
testcase_17 | AC | 1 ms
5,376 KB |
testcase_18 | AC | 1 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 1 ms
5,376 KB |
testcase_21 | AC | 1 ms
5,376 KB |
testcase_22 | AC | 1 ms
5,376 KB |
testcase_23 | AC | 5 ms
5,376 KB |
testcase_24 | AC | 15 ms
7,116 KB |
testcase_25 | AC | 33 ms
12,780 KB |
testcase_26 | AC | 6 ms
5,376 KB |
testcase_27 | AC | 13 ms
6,420 KB |
testcase_28 | AC | 14 ms
6,600 KB |
testcase_29 | AC | 7 ms
5,376 KB |
testcase_30 | AC | 18 ms
7,496 KB |
testcase_31 | AC | 43 ms
16,116 KB |
testcase_32 | AC | 8 ms
5,376 KB |
testcase_33 | AC | 38 ms
17,520 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } // op: T * T -> T, associative struct Queue(T, alias op) { import std.functional : binaryFun; alias opFun = binaryFun!op; int asLen, bsLen; T[] as, aas, bs, bbs; this(int n) { asLen = bsLen = 0; reserve(n); } void reserve(int n) { assert(asLen + bsLen <= n); as.length = aas.length = bs.length = bbs.length = n; } void reduce() { for (; bsLen != 0; ++asLen, --bsLen) { as[asLen] = bs[bsLen - 1]; aas[asLen] = (asLen == 0) ? bs[bsLen - 1] : opFun(bs[bsLen - 1], aas[asLen - 1]); } } int size() const { return asLen + bsLen; } void push(T t) { insertBack(t); } void pop() { removeFront(); } T get() { if (asLen == 0) reduce(); assert(asLen != 0); return (bsLen == 0) ? aas[asLen - 1] : opFun(aas[asLen - 1], bbs[bsLen - 1]); } bool empty() const { return (asLen == 0 && bsLen == 0); } void clear() { asLen = bsLen = 0; } T front() { if (asLen == 0) reduce(); assert(asLen != 0); return as[asLen - 1]; } void insertBack(T t) { bs[bsLen] = t; bbs[bsLen] = (bsLen == 0) ? t : opFun(bbs[bsLen - 1], t); ++bsLen; } void removeFront() { if (asLen == 0) reduce(); assert(asLen != 0); --asLen; } } void main() { try { for (; ; ) { const N = readInt; const K = readInt; auto A = new long[N + 2]; foreach (i; 1 .. N + 1) { A[i] = readLong; } auto que = new Queue!(long, "min(a, b)")(N + 2); auto dp = new long[N + 2]; que.push(dp[0] = 0); foreach (i; 1 .. N + 2) { if (i >= K + 1) { que.pop; } dp[i] = que.get + A[i]; que.push(dp[i]); } debug { writeln("dp = ", dp); } const ans = A.sum - dp[N + 1]; writeln(ans); } } catch (EOFException e) { } }