結果

問題 No.1202 お菓子の食べ方
ユーザー 箱星箱星
提出日時 2021-12-18 02:27:43
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 1,409 ms / 2,000 ms
コード長 4,029 bytes
コンパイル時間 15,750 ms
コンパイル使用メモリ 453,400 KB
実行使用メモリ 195,204 KB
最終ジャッジ日時 2024-09-15 03:51:41
合計ジャッジ時間 67,695 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,346 ms
194,832 KB
testcase_01 AC 1,379 ms
195,096 KB
testcase_02 AC 1,352 ms
195,056 KB
testcase_03 AC 1,349 ms
195,100 KB
testcase_04 AC 1,348 ms
194,992 KB
testcase_05 AC 1,372 ms
195,204 KB
testcase_06 AC 1,370 ms
194,952 KB
testcase_07 AC 1,347 ms
195,084 KB
testcase_08 AC 1,353 ms
194,900 KB
testcase_09 AC 1,409 ms
195,104 KB
testcase_10 AC 846 ms
179,512 KB
testcase_11 AC 975 ms
187,836 KB
testcase_12 AC 1,191 ms
191,660 KB
testcase_13 AC 842 ms
178,768 KB
testcase_14 AC 1,183 ms
193,520 KB
testcase_15 AC 830 ms
179,748 KB
testcase_16 AC 1,082 ms
191,576 KB
testcase_17 AC 979 ms
186,820 KB
testcase_18 AC 966 ms
187,756 KB
testcase_19 AC 841 ms
179,036 KB
testcase_20 AC 1,135 ms
194,540 KB
testcase_21 AC 1,138 ms
194,648 KB
testcase_22 AC 901 ms
180,456 KB
testcase_23 AC 1,131 ms
193,832 KB
testcase_24 AC 1,102 ms
193,784 KB
testcase_25 AC 856 ms
179,124 KB
testcase_26 AC 1,140 ms
193,724 KB
testcase_27 AC 1,108 ms
194,176 KB
testcase_28 AC 908 ms
185,060 KB
testcase_29 AC 992 ms
186,748 KB
testcase_30 AC 663 ms
179,236 KB
testcase_31 AC 663 ms
178,984 KB
testcase_32 AC 666 ms
179,184 KB
testcase_33 AC 662 ms
178,960 KB
testcase_34 AC 663 ms
179,208 KB
testcase_35 AC 661 ms
179,216 KB
testcase_36 AC 667 ms
179,244 KB
testcase_37 AC 667 ms
178,984 KB
testcase_38 AC 666 ms
179,204 KB
testcase_39 AC 670 ms
179,060 KB
testcase_40 AC 1,337 ms
195,012 KB
testcase_41 AC 1,335 ms
194,932 KB
testcase_42 AC 1,349 ms
195,172 KB
testcase_43 AC 1,334 ms
195,120 KB
testcase_44 AC 1,334 ms
194,764 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

fun PrintWriter.solve() {
    val n = nextInt()
    val m = nextInt()
    val s = Array(n) { LongArray(m) { nextLong() } }
    var ans = ModInt(0)
    val cc = CombinationCalculator()
    for (x in 0 until n) {
        for (y in 0 until m) {
            val v = s[x][y]
            ans += cc.binom(x + y + v - 1, x.toLong()) * cc.binom(y + v - 1, y.toLong())
            val v1 = if (y + 1 < m) s[x][y + 1] else 0
            ans += cc.binom(x + y.toLong(), x.toLong()) * (cc.binom(x + y + v, v - 1) - cc.binom(x + y + v1, v1 - 1))
            val v2 = if (x + 1 < n) s[x + 1][y] else 0
            ans += cc.binom(x + y.toLong(), x.toLong()) * (cc.binom(x + y + v, v - 1) - cc.binom(x + y + v2, v2 - 1))
        }
    }
    println(ans)
}

// region ModInt
class ModInt(x: Long) {
    companion object {
        //const val MOD = 998244353L
        const val MOD = 1000000007L
    }

    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

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

    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)
        }
    }
}

fun main() {
    Thread(null, {
        val writer = PrintWriter(System.out, false)
        writer.solve()
        writer.flush()
    }, "solve", abs(1L.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