結果

問題 No.1095 Smallest Kadomatsu Subsequence
ユーザー yakamoto
提出日時 2020-06-26 21:39:47
言語 Kotlin
(2.1.0)
結果
AC  
実行時間 1,049 ms / 2,000 ms
コード長 3,341 bytes
コンパイル時間 18,102 ms
コンパイル使用メモリ 454,384 KB
実行使用メモリ 122,180 KB
最終ジャッジ日時 2024-07-04 20:11:11
合計ジャッジ時間 35,608 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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 (B[i][1][0] != -1L && B[i][1][1] != -1L) {
ans = min(B[i][1].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()
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0