結果

問題 No.1202 お菓子の食べ方
ユーザー 箱星箱星
提出日時 2020-12-15 16:25:30
言語 Kotlin
(1.9.23)
結果
RE  
実行時間 -
コード長 3,666 bytes
コンパイル時間 16,644 ms
コンパイル使用メモリ 453,988 KB
実行使用メモリ 162,452 KB
最終ジャッジ日時 2024-09-20 01:44:55
合計ジャッジ時間 51,483 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,073 ms
162,452 KB
testcase_01 AC 1,067 ms
162,344 KB
testcase_02 RE -
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 AC 584 ms
134,068 KB
testcase_11 AC 766 ms
151,200 KB
testcase_12 AC 928 ms
157,852 KB
testcase_13 AC 597 ms
133,920 KB
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 AC 741 ms
155,280 KB
testcase_19 RE -
testcase_20 AC 871 ms
157,400 KB
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 AC 621 ms
148,508 KB
testcase_26 RE -
testcase_27 RE -
testcase_28 AC 671 ms
149,464 KB
testcase_29 RE -
testcase_30 AC 424 ms
138,588 KB
testcase_31 AC 423 ms
138,256 KB
testcase_32 AC 425 ms
138,528 KB
testcase_33 AC 421 ms
138,448 KB
testcase_34 AC 423 ms
138,396 KB
testcase_35 AC 420 ms
138,356 KB
testcase_36 AC 419 ms
138,536 KB
testcase_37 AC 417 ms
138,388 KB
testcase_38 AC 419 ms
138,368 KB
testcase_39 AC 423 ms
138,540 KB
testcase_40 RE -
testcase_41 RE -
testcase_42 RE -
testcase_43 RE -
testcase_44 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

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

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

const val fac_size = 600000
var fac_initialized = false
val arr_fac = Array(fac_size) { ModInt(1) }
val arr_invfac = Array(fac_size) { ModInt(1) }

fun facInitialize() {
    for (i in 1 until fac_size) {
        arr_fac[i] = arr_fac[i - 1] * ModInt(i)
    }
    arr_invfac[fac_size - 1] = arr_fac[fac_size - 1].inv()
    for (i in fac_size - 2 downTo 1) {
        arr_invfac[i] = arr_invfac[i + 1] * ModInt(i + 1)
    }
    fac_initialized = true
}

fun fac(n: Int): ModInt {
    if (!fac_initialized) facInitialize()
    return arr_fac[n]
}

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

fun invfac(n: Int): ModInt {
    if (!fac_initialized) facInitialize()
    return arr_invfac[n]
}

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

fun comb(n: Long, k: Long): ModInt {
    return if (k in 0..n) {
        fac(n) * invfac(k) * invfac(n - k)
    } else {
        ModInt(0)
    }
}

fun comb2(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 PrintWriter.solve() {
    val n = nextInt()
    val m = nextInt()
    val s = Array(n) { LongArray(m) { nextLong() } }
    var ans = ModInt(0)
    for (x in 0 until n) {
        for (y in 0 until m) {
            val v = s[x][y]
            ans += comb(x + y + v - 1, x.toLong()) * comb(y + v - 1, y.toLong())
            val v1 = if (y + 1 < m) s[x][y + 1] else 0
            ans += comb(x + y.toLong(), x.toLong()) * (comb(x + y + v, v - 1) - comb(x + y + v1, v1 - 1))
            val v2 = if (x + 1 < n) s[x + 1][y] else 0
            ans += comb(x + y.toLong(), x.toLong()) * (comb(x + y + v, v - 1) - comb(x + y + v2, v2 - 1))
        }
    }
    println(ans)
}

fun main() {
    val writer = PrintWriter(System.out, false)
    writer.solve()
    writer.flush()
}

// 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