結果
問題 | No.1702 count good string |
ユーザー |
|
提出日時 | 2021-10-08 22:59:15 |
言語 | Kotlin (2.1.0) |
結果 |
AC
|
実行時間 | 1,624 ms / 2,000 ms |
コード長 | 3,093 bytes |
コンパイル時間 | 15,452 ms |
コンパイル使用メモリ | 459,844 KB |
実行使用メモリ | 203,844 KB |
最終ジャッジ日時 | 2024-07-23 06:17:54 |
合計ジャッジ時間 | 61,488 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 47 |
ソースコード
import java.io.PrintWriterimport java.util.*import kotlin.math.*fun helper(n: Int, s: String, 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]}fun PrintWriter.solve() {val n = nextInt()val s = nextLine()var ans = ModInt(0)val lst = mutableListOf("yukicoder")for (i in 0 until 9) {val t = "yukicoder".toCharArray().withIndex().map { if (it.index == i) '?' else it.value }.joinToString("")lst.add(t)}for (t in lst) {ans += helper(n, s, t)}println(ans)}// region ModIntclass ModInt(x: Long) {companion object {const val MOD = 1000000007L//const val MOD = 998244353L}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"}}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", 1.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