結果
問題 | No.1095 Smallest Kadomatsu Subsequence |
ユーザー | yakamoto |
提出日時 | 2020-06-26 21:37:59 |
言語 | Kotlin (1.9.23) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,236 bytes |
コンパイル時間 | 19,359 ms |
コンパイル使用メモリ | 440,480 KB |
実行使用メモリ | 111,988 KB |
最終ジャッジ日時 | 2023-09-18 03:32:31 |
合計ジャッジ時間 | 38,691 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 285 ms
53,740 KB |
testcase_01 | AC | 285 ms
53,952 KB |
testcase_02 | AC | 268 ms
50,320 KB |
testcase_03 | AC | 285 ms
53,924 KB |
testcase_04 | WA | - |
testcase_05 | AC | 282 ms
53,848 KB |
testcase_06 | AC | 282 ms
53,964 KB |
testcase_07 | AC | 287 ms
53,832 KB |
testcase_08 | WA | - |
testcase_09 | AC | 288 ms
53,864 KB |
testcase_10 | WA | - |
testcase_11 | AC | 292 ms
53,868 KB |
testcase_12 | WA | - |
testcase_13 | AC | 425 ms
57,260 KB |
testcase_14 | AC | 436 ms
57,356 KB |
testcase_15 | WA | - |
testcase_16 | AC | 425 ms
57,192 KB |
testcase_17 | WA | - |
testcase_18 | AC | 431 ms
57,372 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 428 ms
57,376 KB |
testcase_23 | AC | 1,084 ms
103,148 KB |
testcase_24 | AC | 1,226 ms
110,724 KB |
testcase_25 | AC | 1,079 ms
101,348 KB |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 859 ms
99,396 KB |
testcase_29 | AC | 847 ms
99,616 KB |
testcase_30 | AC | 1,012 ms
101,228 KB |
testcase_31 | AC | 1,153 ms
111,492 KB |
testcase_32 | AC | 1,168 ms
111,280 KB |
ソースコード
import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.util.* import kotlin.math.abs import kotlin.math.max import kotlin.math.min val MOD = 1_000_000_007L class Solver(stream: InputStream, private val out: java.io.PrintWriter) { fun solve() { val N = ni() val A = nal(N) val set = TreeSet<Long>() val B = Array(N){Array(2){LongArray(2){-1} } } for (i in 0 until N) { val mn = if (set.isEmpty()) null else set.first() if (mn != null && mn < A[i]) B[i][0][0] = mn val gt = set.higher(A[i]) if (gt != null && gt > A[i]) B[i][1][0] = gt set += A[i] } set.clear() for (i in N - 1 downTo 0) { val mn = if (set.isEmpty()) null else set.first() if (mn != null && mn < A[i]) B[i][0][1] = mn val gt = set.higher(A[i]) if (gt != null && gt > A[i]) B[i][1][1] = gt set += A[i] } val INF = 1e18.toLong() var ans = INF for (i in 0 until N) { if (B[i][0][0] != -1L && B[i][0][1] != -1L) { ans = min(B[i][0].sum() + A[i], ans) } } if (ans == INF) out.println(-1) else out.println(ans) } private val isDebug = try { // なんか本番でエラーでる System.getenv("MY_DEBUG") != null } catch (t: Throwable) { false } private var tokenizer: StringTokenizer? = null private val reader = BufferedReader(InputStreamReader(stream), 32768) private fun next(): String { while (tokenizer == null || !tokenizer!!.hasMoreTokens()) { tokenizer = StringTokenizer(reader.readLine()) } return tokenizer!!.nextToken() } private fun ni() = next().toInt() private fun nl() = next().toLong() private fun ns() = next() private fun na(n: Int, offset: Int = 0): IntArray { return map(n) { ni() + offset } } private fun nal(n: Int, offset: Int = 0): LongArray { val res = LongArray(n) for (i in 0 until n) { res[i] = nl() + offset } return res } private fun na2(n: Int, offset: Int = 0): Array<IntArray> { val a = Array(2){IntArray(n)} for (i in 0 until n) { for (e in a) { e[i] = ni() + offset } } return a } private inline fun map(n: Int, f: (Int) -> Int): IntArray { val res = IntArray(n) for (i in 0 until n) { res[i] = f(i) } return res } private inline fun debug(msg: () -> String) { if (isDebug) System.err.println(msg()) } private fun debug(a: LongArray) { debug { a.joinToString(" ") } } private fun debug(a: IntArray) { debug { a.joinToString(" ") } } private fun debug(a: BooleanArray) { debug { a.map { if (it) 1 else 0 }.joinToString("") } } private fun debugDim(A: Array<LongArray>) { if (isDebug) { for (a in A) { debug(a) } } } private fun debugDim(A: Array<IntArray>) { if (isDebug) { for (a in A) { debug(a) } } } /** * 勝手にimport消されるのを防ぎたい */ private fun hoge() { min(1, 2) max(1, 2) abs(-10) } } fun main() { val out = java.io.PrintWriter(System.out) Solver(System.`in`, out).solve() out.flush() }