結果

問題 No.1916 Making Palindrome on Gird
ユーザー 箱星箱星
提出日時 2022-02-22 22:34:58
言語 Kotlin
(1.9.23)
結果
WA  
実行時間 -
コード長 4,401 bytes
コンパイル時間 18,633 ms
コンパイル使用メモリ 463,736 KB
実行使用メモリ 249,680 KB
最終ジャッジ日時 2024-06-30 22:24:47
合計ジャッジ時間 49,093 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 295 ms
58,524 KB
testcase_01 AC 296 ms
58,364 KB
testcase_02 AC 310 ms
58,540 KB
testcase_03 WA -
testcase_04 AC 304 ms
58,652 KB
testcase_05 AC 317 ms
58,476 KB
testcase_06 AC 301 ms
58,476 KB
testcase_07 AC 300 ms
58,612 KB
testcase_08 AC 306 ms
58,592 KB
testcase_09 AC 296 ms
58,372 KB
testcase_10 AC 294 ms
58,452 KB
testcase_11 AC 303 ms
58,544 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 636 ms
127,424 KB
testcase_15 WA -
testcase_16 AC 660 ms
114,340 KB
testcase_17 AC 1,346 ms
229,316 KB
testcase_18 AC 1,622 ms
249,648 KB
testcase_19 AC 1,577 ms
249,488 KB
testcase_20 AC 1,659 ms
249,680 KB
testcase_21 AC 1,634 ms
249,600 KB
testcase_22 AC 1,579 ms
248,976 KB
testcase_23 AC 859 ms
244,936 KB
testcase_24 AC 819 ms
237,156 KB
testcase_25 AC 805 ms
237,816 KB
testcase_26 AC 830 ms
239,188 KB
testcase_27 AC 834 ms
237,924 KB
testcase_28 AC 1,941 ms
249,048 KB
testcase_29 AC 1,904 ms
248,892 KB
testcase_30 AC 1,884 ms
249,048 KB
testcase_31 AC 1,977 ms
248,632 KB
testcase_32 AC 1,885 ms
248,880 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

fun PrintWriter.solve() {
    val h = nextInt()
    val w = nextInt()
    val s = Array(h) { nextLine().toCharArray() }
    val dp = Array(h + 1) { Array(h + 1) { ModIntArray(h + w) { ModInt(0) } } }
    if (s[0][0] == s[h - 1][w - 1]) {
        dp[0][h - 1][0] = ModInt(1)
    }
    fun inRange(i: Int, j: Int): Boolean {
        return i in 0 until h && j in 0 until w
    }
    for (k in 1 until h + w) {
    for (i in 0 until h) {
        for (j in 0 until h) {
                val l = h + w - 2 - k
                if (inRange(i - 1, k - i)) {
                    if (inRange(j + 1, l - j) && s[i - 1][k - i] == s[j + 1][l - j]) {
                        dp[i][j][k] += dp[i - 1][j + 1][k - 1]
                    }
                    if (inRange(j, l + 1 - j) && s[i - 1][k - i] == s[j][l + 1 - j]) {
                        dp[i][j][k] += dp[i - 1][j][k - 1]
                    }
                }
                if (inRange(i, k - 1 - i)) {
                    if (inRange(j + 1, l - j) && s[i][k - 1 - i] == s[j + 1][l - j]) {
                        dp[i][j][k] += dp[i][j + 1][k - 1]
                    }
                    if (inRange(j, l + 1 - j) && s[i][k - 1 - i] == s[j][l + 1 - j]) {
                        dp[i][j][k] += dp[i][j][k - 1]
                    }
                }
            }
        }
    }
    var ans = ModInt(0)
    val k = (h + w) / 2 - 1
    if ((h + w) % 2 == 0) {
        for (i in 0 until h) {
            ans += dp[i][i][k]
        }
    } else {
        for (i in 0 until h) {
            ans += dp[i][i][k]
            if (i + 1 < h) {
                ans += dp[i][i + 1][k]
            }
        }
    }
    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"
    }
}

class ModIntArray(n: Int) {
    private val a = LongArray(n) { 0L }

    constructor(n: Int, init: (Int) -> ModInt) : this(n) {
        for (i in 0 until n) {
            a[i] = init(i).x
        }
    }

    operator fun set(i: Int, x: ModInt) {
        a[i] = x.x
    }

    operator fun get(i: Int): ModInt {
        return ModInt(a[i])
    }

    fun joinToString(s: String): String {
        return a.joinToString(s)
    }
}

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", 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