#585178 (Kotlin) No.1299 Random Array Score

• 問題: No.1299 Random Array Score
• ユーザー: 箱星
• 提出日時: 2020-11-27 21:37:08
• 言語: Kotlin (2.1.0)
• 結果: AC
• 実行時間: 543 ms / 2,000 ms
• コード長: 2,656 bytes
• コンパイル時間: 15,712 ms
• コンパイル使用メモリ: 451,352 KB
• 実行使用メモリ: 87,196 KB
• 最終ジャッジ日時: 2024-07-26 11:55:54
• 合計ジャッジ時間: 35,282 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 34

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
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()
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX