結果
問題 | No.1435 Mmm...... |
ユーザー | yakamoto |
提出日時 | 2021-03-20 00:25:40 |
言語 | Kotlin (1.9.23) |
結果 |
TLE
|
実行時間 | - |
コード長 | 5,154 bytes |
コンパイル時間 | 20,501 ms |
コンパイル使用メモリ | 464,028 KB |
実行使用メモリ | 242,928 KB |
最終ジャッジ日時 | 2024-11-19 03:32:00 |
合計ジャッジ時間 | 56,538 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 272 ms
54,164 KB |
testcase_01 | AC | 268 ms
53,784 KB |
testcase_02 | AC | 270 ms
52,868 KB |
testcase_03 | AC | 271 ms
52,924 KB |
testcase_04 | AC | 276 ms
52,984 KB |
testcase_05 | AC | 272 ms
52,952 KB |
testcase_06 | AC | 1,411 ms
166,624 KB |
testcase_07 | AC | 1,796 ms
199,504 KB |
testcase_08 | AC | 1,849 ms
222,540 KB |
testcase_09 | AC | 1,812 ms
210,520 KB |
testcase_10 | AC | 1,473 ms
176,352 KB |
testcase_11 | AC | 1,460 ms
172,512 KB |
testcase_12 | AC | 1,347 ms
166,500 KB |
testcase_13 | AC | 1,503 ms
167,384 KB |
testcase_14 | AC | 1,119 ms
147,576 KB |
testcase_15 | TLE | - |
testcase_16 | AC | 1,661 ms
196,416 KB |
testcase_17 | AC | 1,319 ms
152,760 KB |
testcase_18 | AC | 1,931 ms
231,204 KB |
testcase_19 | AC | 1,439 ms
173,492 KB |
testcase_20 | AC | 1,835 ms
220,768 KB |
testcase_21 | AC | 1,927 ms
242,852 KB |
testcase_22 | AC | 1,992 ms
239,516 KB |
testcase_23 | AC | 1,779 ms
242,916 KB |
testcase_24 | AC | 1,783 ms
242,928 KB |
testcase_25 | AC | 1,756 ms
238,948 KB |
testcase_26 | AC | 1,769 ms
242,880 KB |
testcase_27 | AC | 1,936 ms
235,568 KB |
コンパイルメッセージ
Main.kt:29:3: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types inline fun max(v: Val) = if (a > v.a) this else v ^ Main.kt:30:3: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types inline fun min(v: Val) = if (a <= v.a) this else v ^ Main.kt:31:26: warning: the corresponding parameter in the supertype 'Comparable' is named 'other'. This may cause problems when calling this function with named arguments. override fun compareTo(v: Val): Int { ^ Main.kt:41:3: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types inline fun merge(e: Entry): Entry { ^ Main.kt:56:3: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types inline fun merge0(e: Entry): Entry { ^ Main.kt:108:13: warning: name shadowed: k val k = n2k[len] ^ Main.kt:211:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types private inline fun debug(a: LongArray) { ^ Main.kt:215:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types private inline fun debug(a: IntArray) { ^ Main.kt:219:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types private inline fun debug(a: BooleanArray) { ^ Main.kt:223:11: warning: expected performance impact from inlining is insignificant. Inlining works best for functions with parameters of functional types private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.jo
ソースコード
import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.lang.AssertionError import java.util.* import kotlin.collections.HashSet import kotlin.math.abs import kotlin.math.max import kotlin.math.min val MOD = 1_000_000_007 /** * 単調減少 * [l, h) 方式 * @return マッチするものがなかったらl */ inline fun findMax(l: Int, r: Int, f: (Int) -> Boolean): Int { var low = l var high = r + 1 while(high - low > 1) { val m = (low + high) / 2 if (f(m)) low = m else high = m } return low } data class Val(val i: Int, val a: Int) : Comparable<Val> { inline fun max(v: Val) = if (a > v.a) this else v inline fun min(v: Val) = if (a <= v.a) this else v override fun compareTo(v: Val): Int { if (a != v.a) return a.compareTo(v.a) return i.compareTo(v.i) } } data class Entry(val mx: Val, val mn1: Val, val mn2: Val?) { /** * thisとeに重複がある場合 */ inline fun merge(e: Entry): Entry { val mns = HashSet<Val>() mns += mn1 if (mn2 != null) mns += mn2 mns += e.mn1 if (e.mn2 != null) mns += e.mn2 val sort = mns.toMutableList() sort.sort() // println(sort.take(2)) return Entry(mx.max(e.mx), sort[0], if (sort.size >= 2) sort[1] else null) } /** * 重複する部分がないとき */ inline fun merge0(e: Entry): Entry { var mn2 = this.mn1.max(e.mn1) if (this.mn2 != null) mn2 = mn2.min(this.mn2) if (e.mn2 != null) mn2 = mn2.min(e.mn2) return Entry(mx.max(e.mx), this.mn1.min(e.mn1), mn2) } } class Solver(stream: InputStream, private val out: java.io.PrintWriter) { private val reader = BufferedReader(InputStreamReader(stream), 32768) private val N = ni() private val A = na(N) fun solve() { val tbl = mutableListOf(Array(N){Entry(Val(it, A[it]), Val(it, A[it]), null)}) var k = 1 while (2 * k <= N) { val lst = tbl.last() val build = Array(N){lst[it]} for (i in 0 until N) { if (i + k < N) { build[i] = lst[i].merge0(lst[i + k]) } else { build[i] = lst[i] } } tbl += build k *= 2 } val n2k = IntArray(N + 1) val n2ksize = IntArray(N + 1) k = 1 var ki = 0 for (n in 1..N) { if (k * 2 == n) { k *= 2 ki++ } n2k[n] = ki n2ksize[n] = k } debug(n2k) debug(n2ksize) debug{"${tbl[1][2]}"} var ans = 0L for (i in 0 until N) { val len = findMax(1, N - i) { len -> val k = n2k[len] val ksize = n2ksize[len] var e = tbl[k][i] val j = len - ksize e = e.merge(tbl[k][i + j]) e.mn2 != null && e.mn1.a + e.mn2!!.a >= e.mx.a } debug{"$i $len"} if (len > 1) ans += len - 1 } out.println(ans) } private val isDebug = try { // なんか本番でエラーでる System.getenv("MY_DEBUG") != null } catch (t: Throwable) { false } private var tokenizer: StringTokenizer? = null 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 IntArray(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 debug(msg: () -> String) { if (isDebug) System.err.println(msg()) } /** * コーナーケースでエラー出たりするので、debug(dp[1])のように添え字付きの場合はdebug{}をつかうこと */ private inline fun debug(a: LongArray) { debug { a.joinToString(" ") } } private inline fun debug(a: IntArray) { debug { a.joinToString(" ") } } private inline fun debug(a: BooleanArray) { debug { toString(a) } } private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")} private inline fun debugDim(A: Array<LongArray>) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array<IntArray>) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array<BooleanArray>) { if (isDebug) { for (a in A) { debug(a) } } } /** * 勝手にimport消されるのを防ぎたい */ private fun hoge() { min(1, 2) max(1, 2) abs(-10) } private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()} } fun main() { val out = java.io.PrintWriter(System.out) Solver(System.`in`, out).solve() out.flush() }