結果
問題 | No.1629 Sorting Integers (SUM of M) |
ユーザー | 👑 箱 |
提出日時 | 2021-07-30 21:16:42 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 581 ms / 2,000 ms |
コード長 | 3,713 bytes |
コンパイル時間 | 19,642 ms |
コンパイル使用メモリ | 430,128 KB |
実行使用メモリ | 125,992 KB |
最終ジャッジ日時 | 2023-10-14 02:57:42 |
合計ジャッジ時間 | 30,721 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 466 ms
114,552 KB |
testcase_01 | AC | 464 ms
114,760 KB |
testcase_02 | AC | 463 ms
114,856 KB |
testcase_03 | AC | 464 ms
114,520 KB |
testcase_04 | AC | 569 ms
125,964 KB |
testcase_05 | AC | 464 ms
115,064 KB |
testcase_06 | AC | 470 ms
114,680 KB |
testcase_07 | AC | 575 ms
125,992 KB |
testcase_08 | AC | 572 ms
125,860 KB |
testcase_09 | AC | 577 ms
125,908 KB |
testcase_10 | AC | 565 ms
125,968 KB |
testcase_11 | AC | 565 ms
125,828 KB |
testcase_12 | AC | 566 ms
125,940 KB |
testcase_13 | AC | 572 ms
125,900 KB |
testcase_14 | AC | 563 ms
125,828 KB |
testcase_15 | AC | 574 ms
125,656 KB |
testcase_16 | AC | 575 ms
125,772 KB |
testcase_17 | AC | 581 ms
125,724 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextInt() val c = Array(9) { nextInt() } var ans = ModInt(0) var pow10 = ModInt(1) val cc = CombinationCalculator() for (i in 0 until n) { ans += pow10 pow10 *= ModInt(10) } var e = ModInt(0) val fact = cc.fac(n - 1) for (i in 0 until 9) { if (c[i] == 0) continue var v = fact for (j in 0 until 9) { if (i != j) { v /= cc.fac(c[j]) } else { v /= cc.fac(c[j] - 1) } } e += (i + 1).toModInt() * v } ans *= e 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 class CombinationCalculator { companion object { private const val fac_size = 600000 } private val arrFac = Array(fac_size) { ModInt(1) } private val arrInvfac = Array(fac_size) { ModInt(1) } init { for (i in 1 until fac_size) { arrFac[i] = arrFac[i - 1] * ModInt(i) } arrInvfac[fac_size - 1] = arrFac[fac_size - 1].inv() for (i in fac_size - 2 downTo 1) { arrInvfac[i] = arrInvfac[i + 1] * ModInt(i + 1) } } fun fac(n: Int): ModInt { return arrFac[n] } fun fac(n: Long): ModInt { return fac(n.toInt()) } fun invfac(n: Int): ModInt { return arrInvfac[n] } fun invfac(n: Long): ModInt { return invfac(n.toInt()) } fun binom(n: Long, k: Long): ModInt { return if (k in 0..n) { arrFac[n.toInt()] * arrInvfac[k.toInt()] * arrInvfac[(n - k).toInt()] } else { ModInt(0) } } } 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