結果
問題 | No.1916 Making Palindrome on Gird |
ユーザー | 箱星 |
提出日時 | 2022-02-22 22:38:03 |
言語 | Kotlin (2.1.0) |
結果 |
AC
|
実行時間 | 1,830 ms / 3,000 ms |
コード長 | 4,503 bytes |
コンパイル時間 | 20,384 ms |
コンパイル使用メモリ | 469,632 KB |
実行使用メモリ | 252,132 KB |
最終ジャッジ日時 | 2024-06-30 22:27:20 |
合計ジャッジ時間 | 47,591 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
01_ | AC * 10 |
other | AC * 23 |
入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 289 ms
58,588 KB |
testcase_01 | AC | 287 ms
58,584 KB |
testcase_02 | AC | 302 ms
58,612 KB |
testcase_03 | AC | 294 ms
58,536 KB |
testcase_04 | AC | 296 ms
58,524 KB |
testcase_05 | AC | 297 ms
58,608 KB |
testcase_06 | AC | 297 ms
58,628 KB |
testcase_07 | AC | 299 ms
58,620 KB |
testcase_08 | AC | 304 ms
58,528 KB |
testcase_09 | AC | 303 ms
58,624 KB |
testcase_10 | AC | 293 ms
58,492 KB |
testcase_11 | AC | 298 ms
58,548 KB |
testcase_12 | AC | 298 ms
58,612 KB |
testcase_13 | AC | 743 ms
137,948 KB |
testcase_14 | AC | 635 ms
127,784 KB |
testcase_15 | AC | 804 ms
151,508 KB |
testcase_16 | AC | 676 ms
115,244 KB |
testcase_17 | AC | 1,239 ms
231,552 KB |
testcase_18 | AC | 1,524 ms
252,124 KB |
testcase_19 | AC | 1,551 ms
252,128 KB |
testcase_20 | AC | 1,629 ms
251,864 KB |
testcase_21 | AC | 1,530 ms
251,864 KB |
testcase_22 | AC | 1,570 ms
251,936 KB |
testcase_23 | AC | 838 ms
247,528 KB |
testcase_24 | AC | 800 ms
239,356 KB |
testcase_25 | AC | 785 ms
239,380 KB |
testcase_26 | AC | 813 ms
241,272 KB |
testcase_27 | AC | 805 ms
238,920 KB |
testcase_28 | AC | 1,830 ms
251,976 KB |
testcase_29 | AC | 1,786 ms
251,896 KB |
testcase_30 | AC | 1,776 ms
252,132 KB |
testcase_31 | AC | 1,777 ms
251,956 KB |
testcase_32 | AC | 1,766 ms
252,044 KB |
ソースコード
import java.io.PrintWriterimport 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 - kif (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 - 1if ((h + w) % 2 == 0) {for (i in 0 until h) {ans += dp[i][i][k]}} else {for (i in 0 until h) {if (s[i][k - i] == s[i][k + 1 - i]) {ans += dp[i][i][k]}if (i + 1 < h && s[i][k - i] == s[i + 1][k - i]) {ans += dp[i][i + 1][k]}}}println(ans)}// region ModIntclass ModInt(x: Long) {companion object {//const val MOD = 998244353Lconst val MOD = 1000000007L}constructor(y: Int) : this(y.toLong())val x = (x % MOD + MOD) % MODoperator 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 *= aif (exp and 1L == 0L) return areturn this * a}fun inv(): ModInt {return this.pow(MOD - 2)}override fun equals(other: Any?): Boolean {if (this === other) return trueif (javaClass != other?.javaClass) return falseother as ModIntif (x != other.x) return falsereturn 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}// endregionfun 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 Scannerprivate 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