結果
| 問題 | No.1360 [Zelkova 4th Tune] 協和音 |
| ユーザー |
 da_louis
|
| 提出日時 | 2021-01-22 22:47:45 |
| 言語 | Kotlin (1.9.23) |
| 結果 |
AC
|
| 実行時間 | 1,137 ms / 2,000 ms |
| コード長 | 15,035 bytes |
| コンパイル時間 | 25,599 ms |
| コンパイル使用メモリ | 476,928 KB |
| 実行使用メモリ | 89,988 KB |
| 最終ジャッジ日時 | 2024-06-08 16:45:46 |
| 合計ジャッジ時間 | 50,643 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 328 ms
55,836 KB |
| testcase_01 | AC | 331 ms
55,684 KB |
| testcase_02 | AC | 330 ms
55,708 KB |
| testcase_03 | AC | 326 ms
55,804 KB |
| testcase_04 | AC | 327 ms
55,820 KB |
| testcase_05 | AC | 332 ms
55,764 KB |
| testcase_06 | AC | 329 ms
55,924 KB |
| testcase_07 | AC | 327 ms
55,880 KB |
| testcase_08 | AC | 321 ms
55,748 KB |
| testcase_09 | AC | 331 ms
55,644 KB |
| testcase_10 | AC | 327 ms
55,680 KB |
| testcase_11 | AC | 325 ms
55,672 KB |
| testcase_12 | AC | 332 ms
55,720 KB |
| testcase_13 | AC | 335 ms
55,824 KB |
| testcase_14 | AC | 335 ms
55,944 KB |
| testcase_15 | AC | 337 ms
55,980 KB |
| testcase_16 | AC | 333 ms
55,848 KB |
| testcase_17 | AC | 327 ms
55,988 KB |
| testcase_18 | AC | 332 ms
55,796 KB |
| testcase_19 | AC | 341 ms
56,224 KB |
| testcase_20 | AC | 334 ms
56,012 KB |
| testcase_21 | AC | 321 ms
55,948 KB |
| testcase_22 | AC | 355 ms
56,260 KB |
| testcase_23 | AC | 552 ms
88,188 KB |
| testcase_24 | AC | 698 ms
89,616 KB |
| testcase_25 | AC | 831 ms
88,504 KB |
| testcase_26 | AC | 424 ms
64,024 KB |
| testcase_27 | AC | 454 ms
62,672 KB |
| testcase_28 | AC | 951 ms
89,620 KB |
| testcase_29 | AC | 563 ms
76,796 KB |
| testcase_30 | AC | 569 ms
87,900 KB |
| testcase_31 | AC | 546 ms
88,052 KB |
| testcase_32 | AC | 430 ms
67,288 KB |
| testcase_33 | AC | 1,019 ms
89,988 KB |
| testcase_34 | AC | 1,137 ms
89,824 KB |
| testcase_35 | AC | 837 ms
88,612 KB |
| testcase_36 | AC | 937 ms
89,408 KB |
| testcase_37 | AC | 1,016 ms
89,216 KB |
| testcase_38 | AC | 835 ms
88,764 KB |
| testcase_39 | AC | 999 ms
89,580 KB |
| testcase_40 | AC | 804 ms
88,976 KB |
| testcase_41 | AC | 992 ms
89,524 KB |
| testcase_42 | AC | 840 ms
88,756 KB |
| testcase_43 | AC | 322 ms
55,612 KB |
| testcase_44 | AC | 816 ms
88,868 KB |
| testcase_45 | AC | 321 ms
55,732 KB |
| testcase_46 | AC | 807 ms
88,544 KB |
コンパイルメッセージ
Main.kt:86:13: warning: 'appendln(Int): kotlin.text.StringBuilder /* = java.lang.StringBuilder */' is deprecated. Use appendLine instead. Note that the new method always appends the line feed character '\n' regardless of the system line separator.
appendln(n)
^
Main.kt:119:48: warning: 'toByte(): Byte' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
private fun Byte.isNumeric() = this in '0'.toByte()..'9'.toByte()
^
Main.kt:119:62: warning: 'toByte(): Byte' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
private fun Byte.isNumeric() = this in '0'.toByte()..'9'.toByte()
^
Main.kt:120:68: warning: 'toByte(): Byte' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
private fun Byte.toNumVal() = if (this.isNumeric()) this - '0'.toByte() else error("$this is not numeric")
^
Main.kt:152:22: warning: 'toByte(): Byte' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
if (b == '-'.toByte()) {
^
Main.kt:178:22: warning: 'toByte(): Byte' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
if (b == '-'.toByte()) {
^
Main.kt:184:22: warning: 'toByte(): Byte' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
if (b == '.'.toByte()) {
^
ソースコード
import java.io.ByteArrayInputStream
import java.io.ByteArrayOutputStream
import java.io.PrintStream
fun main() = if (localEnv && execChecker) checker() else contest296c()
fun contest296c() = solve()
@OptIn(ExperimentalStdlibApi::class)
private fun solve() = Messiah_contest296c(MOD).exec {
val N = readInt()
val A = readLong(N)
val B = readLong(N, N)
var answerValue = Long.MIN_VALUE
var answerChoose = listOf<Int>()
searchAllPatterns(arrayOf(true, false), N) { choose ->
val chooseIndex = choose.withIndex().filter { it.value }.map { it.index }
val each = chooseIndex.map { A[it] }.sum()
var bonus = 0L
for (i in 0 until N) for (j in i + 1 until N) {
if (choose[i] && choose[j]) bonus += B[i][j]
}
val sum = each + bonus
if (sum > answerValue) {
answerValue = sum
answerChoose = chooseIndex
}
}
println(answerValue)
println(answerChoose.joinToString(" ") { "${it + 1}" })
}
@Suppress("SameParameterValue")
private inline fun <reified T> searchAllPatterns(patterns: Array<T>, length: Int, action: (Array<T>) -> Unit) {
val patternSize = patterns.size
check(length < 40) { "length:$length is too large! (must be TLE)" }
val pow = (1L..length).fold(1L) { acc: Long, _: Long -> Math.multiplyExact(acc, patternSize.toLong()) }
check(pow <= Int.MAX_VALUE) { "pow:$pow is too large! (must be TLE)" }
val allPatterns = pow.toInt()
for (i in 0 until allPatterns) {
val array = Array(length) { patterns[0] }
var div = 1
for (j in 0 until length) {
array[length - j - 1] = patterns[(i / div) % patternSize]
div *= patternSize
}
action(array)
}
}
private const val MOD = 1_000_000_007
// region kokokara template dayo (^o^)
private const val execChecker = false
private val localEnv =
runCatching { "ENABLE_DEBUG_MODE_FOR_COMPETITIVE_PROGRAMING" in System.getenv() }.getOrNull() ?: false
private fun checker() = Messiah_contest296c(MOD).exec {
debugln("#######################################################")
debugln("############### executing check mode. ###############")
debugln("#######################################################")
fun getOutPut(input: String, action: () -> Unit): String {
System.setIn(ByteArrayInputStream(input.toByteArray()))
val sysOut = ByteArrayOutputStream()
System.setOut(PrintStream(sysOut))
action()
return sysOut.toString()
}
val wrongCases = mutableSetOf<List<String>>()
while (wrongCases.size < 10) {
/*
examples
val randomString = (1..20).map { ('a'..'z').random() }.joinToString("")
val randomNum = Random.nextInt(0,2000)
*/
val n = 0
val input = buildString {
appendln(n)
}
val solve = getOutPut(input, ::solve)
val greedy = getOutPut(input, ::greedy)
if (solve != greedy && wrongCases.add(listOf(solve, greedy))) {
debugln("#################### wrong case: ${wrongCases.size} ####################")
debugln("input:")
debugln(input)
debugln("solve:")
debugln(solve)
debugln("greedy:")
debugln(greedy)
}
}
}
private fun greedy() = Messiah_contest296c(MOD).exec {
TODO()
}
@Suppress("ClassName", "unused", "FunctionName", "PropertyName")
private class Messiah_contest296c(private val mod: Int) {
//////////////////////////////////////////////////
// IO
//////////////////////////////////////////////////
private val input = System.`in`
private val buffer = ByteArray(1024)
private var pointer = 0
private var bufferLength = 0
private val sb = StringBuilder()
private fun Byte.isPrintable() = this in 33..126
private fun Byte.isNumeric() = this in '0'.toByte()..'9'.toByte()
private fun Byte.toNumVal() = if (this.isNumeric()) this - '0'.toByte() else error("$this is not numeric")
private val lineSeparator: String = System.lineSeparator()
private fun hasNextByte(): Boolean {
return if (pointer < bufferLength) true else {
pointer = 0
bufferLength = input.read(buffer)
bufferLength > 0
}
}
private fun readByte(): Byte = if (hasNextByte()) buffer[pointer++] else -1
private fun skipUnprintable() = run { while (hasNextByte() && !buffer[pointer].isPrintable()) pointer++ }
private fun hasNext(): Boolean = run { skipUnprintable() }.run { hasNextByte() }
private fun hasNextOrError() = if (!hasNext()) error("has no next element.") else Unit
fun readString(): String {
hasNextOrError()
val sb = StringBuilder()
var b = readByte()
while (b.isPrintable()) {
sb.appendCodePoint(b.toInt())
b = readByte()
}
return sb.toString()
}
fun readLong(): Long {
hasNextOrError()
var n = 0L
var negative = false
var b = readByte()
if (b == '-'.toByte()) {
negative = true
b = readByte()
}
if (!b.isNumeric()) error("$b is not numeric.")
while (true) {
when {
b.isNumeric() -> n = n * 10 + b.toNumVal()
b.toInt() == -1 || !b.isPrintable() -> return if (negative) -n else n
else -> error("failed to parse. [n=$n, b=$b]")
}
b = readByte()
}
}
fun readInt() = readLong()
.let { if (it in Int.MIN_VALUE..Int.MAX_VALUE) it.toInt() else error("$it is not in range of Int.") }
fun readIntAsIndex() = readInt().dec()
fun readDouble(): Double {
hasNextOrError()
var n = 0.0
var div = 1.0
var negative = false
var b = readByte()
if (b == '-'.toByte()) {
negative = true
b = readByte()
}
do n = n * 10 + b.toNumVal()
while (run { b = readByte() }.run { b.isNumeric() })
if (b == '.'.toByte()) {
while (run { b = readByte() }.run { b.isNumeric() })
n += b.toNumVal() / (run { div *= 10 }.run { div })
}
return if (negative) -n else n
}
fun readString(size: Int): Array<String> = Array(size) { readString() }
@Suppress("UNUSED_PARAMETER")
fun readChars(h: Int, w: Int): Array<CharArray> = Array(h) { readString().toCharArray() }
fun readLong(size: Int): LongArray = LongArray(size) { readLong() }
fun readLong(h: Int, w: Int): Array<LongArray> = Array(h) { readLong(w) }
fun readInt(size: Int): IntArray = IntArray(size) { readInt() }
fun readInt(h: Int, w: Int): Array<IntArray> = Array(h) { readInt(w) }
fun readIntAsIndex(size: Int): IntArray = IntArray(size) { readIntAsIndex() }
fun readIntAsIndex(h: Int, w: Int): Array<IntArray> = Array(h) { readIntAsIndex(w) }
fun readDouble(size: Int): DoubleArray = DoubleArray(size) { readDouble() }
fun readDouble(h: Int, w: Int): Array<DoubleArray> = Array(h) { readDouble(w) }
fun readBooleanWithSeparator(size: Int, trueElement: String): BooleanArray =
BooleanArray(size) { readString() == trueElement }
fun readBooleanWithSeparator(h: Int, w: Int, trueElement: String): Array<BooleanArray> =
Array(h) { readBooleanWithSeparator(w, trueElement) }
@Suppress("UNUSED_PARAMETER")
fun readBooleanWithoutSeparator(size: Int, trueElement: Char): BooleanArray =
readString().map { it == trueElement }.toBooleanArray()
fun readBooleanWithoutSeparator(h: Int, w: Int, trueElement: Char): Array<BooleanArray> =
Array(h) { readBooleanWithoutSeparator(w, trueElement) }
fun println(): Unit = run { sb.append(lineSeparator) }
fun print(any: Any): Unit = run { sb.append(any.toString()) }
fun println(any: Any): Unit = run { sb.append(any.toString() + lineSeparator) }
fun flush() = run { kotlin.io.println(sb); sb.clear() }
fun debugln(any: Any): Unit = run { if (localEnv) System.err.println(any) }
fun debugln(): Unit = run { if (localEnv) System.err.println() }
fun debugln(action: () -> Unit): Unit = run { if (localEnv) action() }
fun exec(action: Messiah_contest296c.() -> Unit) {
var t: Throwable? = null
Thread(null, { action() }, "solve", 128 * 1024 * 1024)
.apply { setUncaughtExceptionHandler { _, t1 -> t = t1 } }
.apply { start() }.join()
t?.let { throw it }
kotlin.io.print(sb)
}
fun readLine(): Nothing = error("readLine is disabled.")
//////////////////////////////////////////////////
// MOD
//////////////////////////////////////////////////
fun Long.invertMod(): Long = invGcd(this).second
fun Long.safeMod(): Long = (this % MOD).let { if (it < 0) it + MOD else it }
fun Long.modPow(p: Long): Long {
var x = this % MOD
var y = p
var result = 1L
while (y > 0) {
if (y % 2 == 1L) result = (result * x) % MOD
y = y shr 1
x = (x * x) % MOD
}
return result
}
fun Long.modPow(p: Long, m: Int): Long {
var x = this % m
var y = p
var result = 1L
while (y > 0) {
if (y % 2 == 1L) result = (result * x) % m
y = y shr 1
x = (x * x) % m
}
return result
}
fun invGcd(a: Long): Pair<Long, Long> {
val am = a.safeMod()
if (a == 0L) return MOD.toLong() to 0L
var s = MOD.toLong()
var t = am
var m0 = 0L
var m1 = 1L
while (t != 0L) {
val u = s / t
s -= t * u
m0 -= m1 * u
var temp = s
s = t
t = temp
temp = m0
m0 = m1
m1 = temp
}
if (m0 < 0) m0 += MOD / s
return s to m0
}
//////////////////////////////////////////////////
// Misc
//////////////////////////////////////////////////
/**
* `n.indices()` is sugar syntax of `0 until n`.
*/
val Int.indices: IntRange get() = 0 until this
/**
* `[index] in [this]` is sugar syntax of `index in 0 until [this]`.
*/
operator fun Int.contains(index: Int): Boolean = index in this.indices
/**
* `[this].mapIndices { transform }` is sugar syntax of `(0 until [this]).map{ transform(it) }`.
*/
inline fun <R> Int.mapIndices(transform: (Int) -> R): List<R> = this.indices.map(transform)
/**
* `[this].mapIndices(x) { transform }` is sugar syntax of
* `(0 until [this]).map{ y1-> (0 until [x]).map { x1-> transform(y1,x1) } }`.
*/
inline fun <R> Int.mapIndices(x: Int, transform: (Int, Int) -> R): List<List<R>> =
this.mapIndices { y1 -> x.mapIndices { x1 -> transform(y1, x1) } }
/**
* `[this].mapIndices(x) { transform }` is sugar syntax of
* `(0 until [this]).map{ y1-> (0 until [x]).map { x1-> transform(y1,x1) } }`.
*/
inline fun <R> Int.flatMapIndices(x: Int, transform: (Int, Int) -> R): List<R> =
this.indices.flatMap { y1 -> x.mapIndices { x1 -> transform(y1, x1) } }
/**
* `[this].forEachIndices { transform }` is sugar syntax of `(0 until [this]).map{ transform(it) }`.
*/
inline fun Int.forEachIndices(transform: (Int) -> Unit): Unit = this.indices.forEach(transform)
/**
* `[this].forEachIndices(x) { transform }` is sugar syntax of
* `(0 until [this]).map{ y1-> (0 until [x]).map { x1-> transform(y1,x1) } }`.
*/
inline fun Int.forEachIndices(x: Int, transform: (Int, Int) -> Unit): Unit =
this.forEachIndices { y1 -> x.forEachIndices { x1 -> transform(y1, x1) } }
/**
* get characters numeric value.
* e.g.: '0' to 0
*/
fun Char.toNumericValue(): Int = this - '0'
fun Char.caseToIndexedValue(): Int = this - 'a'
// fun Char.isLowerCase() = this in 'a'..'z'
//
// fun Char.isUpperCase() = this in 'A'..'Z'
/**
* make triple. e.g.:`1 to 2 to 3`
*/
infix fun <A, B, C> Pair<A, B>.to(c: C): Triple<A, B, C> = Triple(this.first, this.second, c)
fun YesNo(b: Boolean): String = if (b) Yes else No
val Yes = "Yes"
val No = "No"
fun YES_NO(b: Boolean): String = if (b) YES else NO
val YES = "YES"
val NO = "NO"
fun IntArray.swap(a: Int, b: Int): Unit = run { val temp = this[a]; this[a] = this[b]; this[b] = temp }
fun LongArray.swap(a: Int, b: Int): Unit = run { val temp = this[a]; this[a] = this[b]; this[b] = temp }
fun CharArray.swap(a: Int, b: Int): Unit = run { val temp = this[a]; this[a] = this[b]; this[b] = temp }
fun <T> Array<T>.swap(a: Int, b: Int): Unit = run { val temp = this[a]; this[a] = this[b]; this[b] = temp }
fun <T> MutableList<T>.swap(a: Int, b: Int): Unit = run { val temp = this[a]; this[a] = this[b]; this[b] = temp }
fun IntArray.changeMinOf(i: Int, v: Int): Unit = run { this[i] = kotlin.math.min(this[i], v) }
fun IntArray.changeMaxOf(i: Int, v: Int): Unit = run { this[i] = kotlin.math.max(this[i], v) }
fun LongArray.changeMinOf(i: Int, v: Long): Unit = run { this[i] = kotlin.math.min(this[i], v) }
fun LongArray.changeMaxOf(i: Int, v: Long): Unit = run { this[i] = kotlin.math.max(this[i], v) }
/**
* same usage as `IntArray.scan`, but it will faster than that.
*/
inline fun IntArray.scanArray(initial: Int, operation: (acc: Int, Int) -> Int): IntArray {
val accumulator = IntArray(this.size + 1).apply { this[0] = initial }
for (i in this.indices) accumulator[i + 1] = operation(accumulator[i], this[i])
return accumulator
}
/**
* same usage as `LongArray.scan`, but it will faster than that.
*/
inline fun LongArray.scanArray(initial: Long, operation: (acc: Long, Long) -> Long): LongArray {
val accumulator = LongArray(this.size + 1).apply { this[0] = initial }
for (i in this.indices) accumulator[i + 1] = operation(accumulator[i], this[i])
return accumulator
}
/**
* same usage as `IntArray.scanReduce`, but it will faster than that.
*/
inline fun IntArray.scanReduceArray(operation: (acc: Int, Int) -> Int): IntArray {
val accumulator = IntArray(this.size).apply { this[0] = this@scanReduceArray[0] }
for (i in 1..this.lastIndex) accumulator[i] = operation(accumulator[i - 1], this[i])
return accumulator
}
/**
* same usage as `LongArray.scanReduce`, but it will faster than that.
*/
inline fun LongArray.scanReduceArray(operation: (acc: Long, Long) -> Long): LongArray {
val accumulator = LongArray(this.size).apply { this[0] = this@scanReduceArray[0] }
for (i in 1..this.lastIndex) accumulator[i] = operation(accumulator[i - 1], this[i])
return accumulator
}
}
// endregion kokomade template dayo (^o^)