結果
問題 | No.1248 Kth Sum |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-10-03 00:47:17 |
言語 | D (dmd 2.106.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,058 bytes |
コンパイル時間 | 911 ms |
コンパイル使用メモリ | 128,084 KB |
実行使用メモリ | 21,920 KB |
最終ジャッジ日時 | 2023-09-04 10:19:22 |
合計ジャッジ時間 | 6,769 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | WA | - |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | WA | - |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,376 KB |
testcase_12 | AC | 1 ms
4,380 KB |
testcase_13 | WA | - |
testcase_14 | AC | 49 ms
17,232 KB |
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 | AC | 1 ms
4,376 KB |
testcase_24 | WA | - |
testcase_25 | AC | 67 ms
21,564 KB |
testcase_26 | WA | - |
testcase_27 | AC | 38 ms
13,064 KB |
testcase_28 | AC | 37 ms
13,024 KB |
testcase_29 | AC | 37 ms
11,216 KB |
testcase_30 | AC | 58 ms
19,648 KB |
testcase_31 | AC | 47 ms
17,416 KB |
testcase_32 | AC | 47 ms
17,392 KB |
testcase_33 | AC | 1 ms
4,376 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
ソースコード
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)); } /* l subseqs x[1] < ... < x[l] (l - 1) (K - 1) < x[1] <= l (K - 1) j K - 1 <= x[j] (2 <= j <= l) for 2 <= j <= l - 1: (l - 1) (K - 1) + j >= j (K - 1) + j >= j K > j K - 1 (conds) <=> x[1] < ... < x[l] (l - 1) (K - 1) < x[1] <= l (K - 1) K l - 1 <= x[l] */ enum INF = 10L^^18; void main() { try { for (; ; ) { const N = readInt(); const K = readInt(); auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong(); } long ans = A[K - 1]; if (K >= 2) { auto tailMin = new long[N + 1]; tailMin[] = INF; foreach_reverse (i; 0 .. N) { tailMin[i] = min(A[i], tailMin[i + 1]); } alias Entry = Tuple!(long, "val", int, "pos"); BinaryHeap!(Array!Entry, "a > b") que; DList!Entry es; long sum = 0; int sz = 0; foreach_reverse (i; K .. N) { const l = (i + (K - 1) - 1) / (K - 1); for (; sz > l - 2; ) { const e = es.back; es.removeBack; sum -= e.val; sz -= 1; que.insert(e); } for (; sz < l - 2 && !que.empty; ) { const e = que.front; que.removeFront; es ~= e; sum += e.val; sz += 1; } if (sz == l - 2 && !que.empty) { long cost; cost += A[i]; cost += sum; // any element from [K l - 1, N)? cost += ((!es.empty && es.back.val >= tailMin[K * l - 1]) ? que.front.val : tailMin[K * l - 1]); debug { writefln("i = %s: l = %s, cost = %s", i, l, cost); } chmin(ans, cost); } que.insert(Entry(A[i], i)); } } writeln(ans); } } catch (EOFException e) { } }