結果
問題 | No.1702 count good string |
ユーザー | 👑 箱 |
提出日時 | 2021-10-08 23:03:29 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 1,958 ms / 2,000 ms |
コード長 | 3,157 bytes |
コンパイル時間 | 18,336 ms |
コンパイル使用メモリ | 430,800 KB |
実行使用メモリ | 147,632 KB |
最終ジャッジ日時 | 2023-09-30 12:26:09 |
合計ジャッジ時間 | 70,097 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 305 ms
56,228 KB |
testcase_01 | AC | 299 ms
58,416 KB |
testcase_02 | AC | 302 ms
57,936 KB |
testcase_03 | AC | 303 ms
56,824 KB |
testcase_04 | AC | 307 ms
58,920 KB |
testcase_05 | AC | 306 ms
58,548 KB |
testcase_06 | AC | 313 ms
56,804 KB |
testcase_07 | AC | 301 ms
56,816 KB |
testcase_08 | AC | 309 ms
58,760 KB |
testcase_09 | AC | 305 ms
56,816 KB |
testcase_10 | AC | 310 ms
57,004 KB |
testcase_11 | AC | 306 ms
56,844 KB |
testcase_12 | AC | 307 ms
58,968 KB |
testcase_13 | AC | 1,942 ms
147,200 KB |
testcase_14 | AC | 1,940 ms
147,424 KB |
testcase_15 | AC | 1,936 ms
145,400 KB |
testcase_16 | AC | 1,943 ms
147,312 KB |
testcase_17 | AC | 1,936 ms
147,024 KB |
testcase_18 | AC | 1,927 ms
147,204 KB |
testcase_19 | AC | 1,937 ms
147,208 KB |
testcase_20 | AC | 1,942 ms
147,024 KB |
testcase_21 | AC | 1,940 ms
147,520 KB |
testcase_22 | AC | 1,936 ms
147,208 KB |
testcase_23 | AC | 351 ms
57,528 KB |
testcase_24 | AC | 351 ms
57,480 KB |
testcase_25 | AC | 354 ms
59,488 KB |
testcase_26 | AC | 348 ms
57,616 KB |
testcase_27 | AC | 353 ms
59,300 KB |
testcase_28 | AC | 348 ms
57,536 KB |
testcase_29 | AC | 351 ms
57,744 KB |
testcase_30 | AC | 357 ms
57,768 KB |
testcase_31 | AC | 352 ms
57,536 KB |
testcase_32 | AC | 352 ms
57,544 KB |
testcase_33 | AC | 1,957 ms
139,272 KB |
testcase_34 | AC | 1,949 ms
140,740 KB |
testcase_35 | AC | 1,929 ms
140,936 KB |
testcase_36 | AC | 1,946 ms
139,032 KB |
testcase_37 | AC | 1,929 ms
138,960 KB |
testcase_38 | AC | 1,933 ms
138,924 KB |
testcase_39 | AC | 1,941 ms
139,248 KB |
testcase_40 | AC | 1,932 ms
140,924 KB |
testcase_41 | AC | 1,938 ms
139,240 KB |
testcase_42 | AC | 1,946 ms
140,788 KB |
testcase_43 | AC | 1,958 ms
147,632 KB |
testcase_44 | AC | 1,927 ms
145,468 KB |
testcase_45 | AC | 292 ms
58,116 KB |
testcase_46 | AC | 293 ms
56,692 KB |
testcase_47 | AC | 297 ms
58,144 KB |
testcase_48 | AC | 300 ms
56,216 KB |
testcase_49 | AC | 292 ms
56,404 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextInt() val s = nextLine() fun helper(t: String): ModInt { val dp = Array(n + 1) { Array(t.length + 1) { ModInt(0) } } dp[0][0] = ModInt(1) for (i in 0 until n) { for (j in 0 until t.length + 1) { dp[i + 1][j] += dp[i][j] } for (j in t.indices) { if (s[i] == t[j]) { dp[i + 1][j + 1] += dp[i][j] } } } return dp[n][t.length] } var ans = ModInt(0) val lst = listOf( "yukicoder", "?ukicoder", "y?kicoder", "yu?icoder", "yuk?coder", "yuki?oder", "yukic?der", "yukico?er", "yukicod?r", "yukicode?" ) for (t in lst) { ans += helper(t) } println(ans) } // region ModInt 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) } 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