結果
問題 | No.1095 Smallest Kadomatsu Subsequence |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-06-26 22:01:53 |
言語 | D (dmd 2.105.2) |
結果 |
AC
|
実行時間 | 316 ms / 2,000 ms |
コード長 | 2,440 bytes |
コンパイル時間 | 1,403 ms |
コンパイル使用メモリ | 159,848 KB |
実行使用メモリ | 39,520 KB |
最終ジャッジ日時 | 2023-09-04 08:18:08 |
合計ジャッジ時間 | 5,642 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 1 ms
4,376 KB |
testcase_13 | AC | 11 ms
4,672 KB |
testcase_14 | AC | 11 ms
4,748 KB |
testcase_15 | AC | 11 ms
4,668 KB |
testcase_16 | AC | 11 ms
4,612 KB |
testcase_17 | AC | 11 ms
6,136 KB |
testcase_18 | AC | 11 ms
4,748 KB |
testcase_19 | AC | 11 ms
4,672 KB |
testcase_20 | AC | 11 ms
4,564 KB |
testcase_21 | AC | 11 ms
4,636 KB |
testcase_22 | AC | 11 ms
4,596 KB |
testcase_23 | AC | 311 ms
37,864 KB |
testcase_24 | AC | 314 ms
38,172 KB |
testcase_25 | AC | 316 ms
39,204 KB |
testcase_26 | AC | 311 ms
37,236 KB |
testcase_27 | AC | 308 ms
37,804 KB |
testcase_28 | AC | 167 ms
28,316 KB |
testcase_29 | AC | 173 ms
37,960 KB |
testcase_30 | AC | 234 ms
37,144 KB |
testcase_31 | AC | 233 ms
39,520 KB |
testcase_32 | AC | 231 ms
38,132 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)); } enum INF = 10L^^18; void main() { try { for (; ; ) { const N = readInt(); auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong(); } auto ls0 = new long[N]; auto ls1 = new long[N]; auto rs0 = new long[N]; auto rs1 = new long[N]; auto set = new RedBlackTree!long; set.clear; foreach (i; 0 .. N) { if (0 < i) { ls0[i] = (set.front < A[i]) ? set.front : INF; auto ran = set.upperBound(A[i]); ls1[i] = ran.empty ? INF : ran.front; } set.insert(A[i]); } set.clear; foreach_reverse (i; 0 .. N) { if (i < N - 1) { rs0[i] = (set.front < A[i]) ? set.front : INF; auto ran = set.upperBound(A[i]); rs1[i] = ran.empty ? INF : ran.front; } set.insert(A[i]); } debug { writeln("ls0 = ", ls0); writeln("ls1 = ", ls1); writeln("rs0 = ", rs0); writeln("rs1 = ", rs1); } long ans = INF; foreach (i; 1 .. N - 1) { chmin(ans, ls0[i] + A[i] + rs0[i]); chmin(ans, ls1[i] + A[i] + rs1[i]); } writeln((ans >= INF) ? -1 : ans); } } catch (EOFException e) { } }