結果
問題 | No.1336 Union on Blackboard |
ユーザー | 👑 箱 |
提出日時 | 2021-01-15 21:27:22 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 500 ms / 2,000 ms |
コード長 | 3,344 bytes |
コンパイル時間 | 17,575 ms |
コンパイル使用メモリ | 425,484 KB |
実行使用メモリ | 84,060 KB |
最終ジャッジ日時 | 2023-08-17 16:04:44 |
合計ジャッジ時間 | 34,127 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 391 ms
82,372 KB |
testcase_01 | AC | 416 ms
82,832 KB |
testcase_02 | AC | 445 ms
82,936 KB |
testcase_03 | AC | 475 ms
83,600 KB |
testcase_04 | AC | 432 ms
82,552 KB |
testcase_05 | AC | 415 ms
82,908 KB |
testcase_06 | AC | 425 ms
82,896 KB |
testcase_07 | AC | 416 ms
82,556 KB |
testcase_08 | AC | 416 ms
82,588 KB |
testcase_09 | AC | 475 ms
83,676 KB |
testcase_10 | AC | 480 ms
83,896 KB |
testcase_11 | AC | 478 ms
83,856 KB |
testcase_12 | AC | 480 ms
83,696 KB |
testcase_13 | AC | 485 ms
83,728 KB |
testcase_14 | AC | 482 ms
83,744 KB |
testcase_15 | AC | 488 ms
83,916 KB |
testcase_16 | AC | 491 ms
83,664 KB |
testcase_17 | AC | 485 ms
84,060 KB |
testcase_18 | AC | 488 ms
83,676 KB |
testcase_19 | AC | 480 ms
83,704 KB |
testcase_20 | AC | 492 ms
83,844 KB |
testcase_21 | AC | 491 ms
83,844 KB |
testcase_22 | AC | 490 ms
83,764 KB |
testcase_23 | AC | 482 ms
83,840 KB |
testcase_24 | AC | 484 ms
83,924 KB |
testcase_25 | AC | 493 ms
83,992 KB |
testcase_26 | AC | 492 ms
83,760 KB |
testcase_27 | AC | 485 ms
83,580 KB |
testcase_28 | AC | 491 ms
83,756 KB |
testcase_29 | AC | 500 ms
83,648 KB |
testcase_30 | AC | 403 ms
82,388 KB |
testcase_31 | AC | 399 ms
82,392 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* // 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) } const val fac_size = 600000 var fac_initialized = false val arr_fac = Array(fac_size) { ModInt(1) } val arr_invfac = Array(fac_size) { ModInt(1) } fun facInitialize() { for (i in 1 until fac_size) { arr_fac[i] = arr_fac[i - 1] * ModInt(i) } arr_invfac[fac_size - 1] = arr_fac[fac_size - 1].inv() for (i in fac_size - 2 downTo 1) { arr_invfac[i] = arr_invfac[i + 1] * ModInt(i + 1) } fac_initialized = true } fun fac(n: Int): ModInt { if (!fac_initialized) facInitialize() return arr_fac[n] } fun fac(n: Long): ModInt { return fac(n.toInt()) } fun invfac(n: Int): ModInt { if (!fac_initialized) facInitialize() return arr_invfac[n] } fun invfac(n: Long): ModInt { return invfac(n.toInt()) } fun comb(n: Long, k: Long): ModInt { return if (k in 0..n) { if (!fac_initialized) facInitialize() arr_fac[n.toInt()] * arr_invfac[k.toInt()] * arr_invfac[(n - k).toInt()] } else { ModInt(0) } } fun comb2(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 PrintWriter.solve() { val numCases = nextInt() case@ for (_i in 0 until numCases) { val n = nextInt() val a = Array(n) { nextInt().toModInt() } println(a.map { it + ModInt(1) }.fold(ModInt(1), { x, y -> x * y }) - ModInt(1)) } } 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