結果

問題 No.1667 Forest
ユーザー 箱星箱星
提出日時 2021-09-03 23:20:35
言語 Kotlin
(2.1.0)
結果
AC  
実行時間 1,371 ms / 3,000 ms
コード長 3,789 bytes
コンパイル時間 13,716 ms
コンパイル使用メモリ 456,564 KB
実行使用メモリ 152,260 KB
最終ジャッジ日時 2024-12-15 18:03:44
合計ジャッジ時間 29,568 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,327 ms
151,600 KB
testcase_01 AC 1,371 ms
151,672 KB
testcase_02 AC 1,310 ms
152,260 KB
testcase_03 AC 505 ms
142,956 KB
testcase_04 AC 1,325 ms
151,608 KB
testcase_05 AC 1,018 ms
149,988 KB
testcase_06 AC 887 ms
150,116 KB
testcase_07 AC 769 ms
148,156 KB
testcase_08 AC 648 ms
143,936 KB
testcase_09 AC 628 ms
145,300 KB
testcase_10 AC 578 ms
143,856 KB
testcase_11 AC 507 ms
142,812 KB
testcase_12 AC 490 ms
143,164 KB
testcase_13 AC 483 ms
143,172 KB
testcase_14 AC 487 ms
143,060 KB
testcase_15 AC 491 ms
143,080 KB
testcase_16 AC 497 ms
143,044 KB
testcase_17 AC 484 ms
142,996 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.PrintWriter
import java.util.*
import kotlin.math.*

fun PrintWriter.solve() {
    val n = nextInt()
    MOD = nextLong()
    val cc = CombinationCalculator()
    val dp = Array(n + 1) { Array(n) { ModInt(0) } }
    for (i in 1..n) {
        if (i >= 2) {
            dp[i][i - 1] = ModInt(i).pow(i - 2L)
        }
        dp[i][0] = ModInt(1)
    }
    for (i in 1..n) {
        for (j in i - 2 downTo 1) {
            for (k in 1..j + 1) {
                dp[i][j] += dp[i - k][j - k + 1] * dp[k][k - 1] * cc.binom(i.toLong(), k.toLong())
            }
            dp[i][j] /= ModInt(i - j)
        }
    }
    println(dp[n].joinToString("\n"))
}

var MOD = 1L

class CombinationCalculator {
    companion object {
        private const val fac_size = 600000
    }

    private val arrFac = Array(fac_size) { ModInt(1) }
    private val arrInvfac = Array(fac_size) { ModInt(1) }

    init {
        for (i in 1 until fac_size) {
            arrFac[i] = arrFac[i - 1] * ModInt(i)
        }
        arrInvfac[fac_size - 1] = arrFac[fac_size - 1].inv()
        for (i in fac_size - 2 downTo 1) {
            arrInvfac[i] = arrInvfac[i + 1] * ModInt(i + 1)
        }
    }

    fun fac(n: Int): ModInt {
        return arrFac[n]
    }

    fun fac(n: Long): ModInt {
        return fac(n.toInt())
    }

    fun invfac(n: Int): ModInt {
        return arrInvfac[n]
    }

    fun invfac(n: Long): ModInt {
        return invfac(n.toInt())
    }

    fun binom(n: Long, k: Long): ModInt {
        return if (k in 0..n) {
            arrFac[n.toInt()] * arrInvfac[k.toInt()] * arrInvfac[(n - k).toInt()]
        } else {
            ModInt(0)
        }
    }
}

// region ModInt
class ModInt(x: Long) {
    constructor(y: Int) : this(y.toLong())

    val x = (x % MOD + MOD) % MOD

    operator fun plus(other: ModInt): ModInt {
        return ModInt(x + other.x)
    }

    operator fun minus(other: ModInt): ModInt {
        return ModInt(x - other.x)
    }

    operator fun times(other: ModInt): ModInt {
        return ModInt(x * other.x)
    }

    operator fun div(other: ModInt): ModInt {
        return this * other.inv()
    }

    fun pow(exp: Long): ModInt {
        if (exp == 0L) return ModInt(1L)
        var a = pow(exp shr 1)
        a *= a
        if (exp and 1L == 0L) return a
        return this * a
    }

    fun inv(): ModInt {
        return this.pow(MOD - 2)
    }

    override fun equals(other: Any?): Boolean {
        if (this === other) return true
        if (javaClass != other?.javaClass) return false

        other as ModInt

        if (x != other.x) return false

        return true
    }

    override fun hashCode(): Int {
        return x.hashCode()
    }

    override fun toString(): String {
        return "$x"
    }
}

fun Long.toModInt(): ModInt {
    return ModInt(this)
}

fun Int.toModInt(): ModInt {
    return ModInt(this)
}

fun binomSimple(n: Long, k: Long): ModInt {
    var numer = ModInt(1)
    var denom = ModInt(1)
    for (i in 0 until k) {
        numer *= ModInt(n - i)
        denom *= ModInt(k - i)
    }
    return numer / denom
}
// endregion

fun main() {
    Thread(null, {
        val writer = PrintWriter(System.out, false)
        writer.solve()
        writer.flush()
    }, "solve", 1.shl(26))
        .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } }
        .apply { start() }.join()
}

// region Scanner
private var st = StringTokenizer("")
private val br = System.`in`.bufferedReader()

fun next(): String {
    while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())
    return st.nextToken()
}

fun nextInt() = next().toInt()
fun nextLong() = next().toLong()
fun nextLine() = br.readLine()
fun nextDouble() = next().toDouble()
// endregion
0