結果
問題 | No.1299 Random Array Score |
ユーザー | 👑 箱 |
提出日時 | 2020-11-27 21:37:08 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 504 ms / 2,000 ms |
コード長 | 2,656 bytes |
コンパイル時間 | 14,734 ms |
コンパイル使用メモリ | 425,036 KB |
実行使用メモリ | 67,368 KB |
最終ジャッジ日時 | 2023-10-01 05:04:33 |
合計ジャッジ時間 | 34,119 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 269 ms
53,244 KB |
testcase_01 | AC | 271 ms
53,372 KB |
testcase_02 | AC | 268 ms
53,244 KB |
testcase_03 | AC | 464 ms
63,084 KB |
testcase_04 | AC | 493 ms
62,972 KB |
testcase_05 | AC | 480 ms
59,080 KB |
testcase_06 | AC | 477 ms
59,056 KB |
testcase_07 | AC | 498 ms
59,548 KB |
testcase_08 | AC | 499 ms
63,004 KB |
testcase_09 | AC | 380 ms
55,988 KB |
testcase_10 | AC | 442 ms
58,884 KB |
testcase_11 | AC | 418 ms
56,688 KB |
testcase_12 | AC | 504 ms
59,532 KB |
testcase_13 | AC | 501 ms
63,076 KB |
testcase_14 | AC | 470 ms
60,108 KB |
testcase_15 | AC | 471 ms
59,104 KB |
testcase_16 | AC | 458 ms
58,952 KB |
testcase_17 | AC | 404 ms
56,756 KB |
testcase_18 | AC | 412 ms
58,844 KB |
testcase_19 | AC | 411 ms
59,532 KB |
testcase_20 | AC | 393 ms
57,432 KB |
testcase_21 | AC | 302 ms
55,920 KB |
testcase_22 | AC | 414 ms
58,588 KB |
testcase_23 | AC | 496 ms
59,408 KB |
testcase_24 | AC | 449 ms
58,824 KB |
testcase_25 | AC | 459 ms
58,952 KB |
testcase_26 | AC | 294 ms
53,480 KB |
testcase_27 | AC | 416 ms
56,772 KB |
testcase_28 | AC | 398 ms
56,784 KB |
testcase_29 | AC | 414 ms
56,928 KB |
testcase_30 | AC | 449 ms
59,436 KB |
testcase_31 | AC | 405 ms
56,668 KB |
testcase_32 | AC | 462 ms
63,372 KB |
testcase_33 | AC | 469 ms
67,320 KB |
testcase_34 | AC | 422 ms
58,648 KB |
testcase_35 | AC | 476 ms
67,368 KB |
testcase_36 | AC | 434 ms
58,760 KB |
ソースコード
import java.io.InputStream import java.io.PrintWriter import java.util.* // ModInt // region class ModInt(x: Long) { companion object { //const val MOD = 1000000007L const val MOD = 998244353L } 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" } } val fac = mutableListOf<ModInt>() val invfac = mutableListOf<ModInt>() fun fact(n: Long, b: Boolean): ModInt { if (fac.count() == 0) { fac.add(ModInt(1)) invfac.add(ModInt(1)) } while (fac.count() <= n) { fac.add(fac.last() * ModInt(fac.count().toLong())) invfac.add(fac.last().inv()) } return if (b) { fac[n.toInt()] } else { invfac[n.toInt()] } } fun comb(n: Long, k: Long): ModInt { return fact(n, true) * fact(k, false) * fact(n - k, false) } fun comb2(n: Long, k: Long): ModInt { var ans = ModInt(1) for (i in 0 until k) { ans = ans * ModInt(n - i) / ModInt(k - i) } return ans } // endregion fun PrintWriter.solve() = with(FastScanner(System.`in`)) { val n = nextInt() val k = nextLong() val a = Array(n) { nextLong() } val s = a.sum() println(ModInt(s) * ModInt(2).pow(k)) } fun main() { val writer = PrintWriter(System.out, false) writer.solve() writer.flush() } class FastScanner(s: InputStream) { private var st = StringTokenizer("") private val br = s.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() }