結果

問題 No.2793 Mancala Master
ユーザー 👑 箱星箱星
提出日時 2024-02-12 00:05:47
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 825 ms / 2,000 ms
コード長 3,086 bytes
コンパイル時間 18,117 ms
コンパイル使用メモリ 449,992 KB
実行使用メモリ 93,500 KB
最終ジャッジ日時 2024-06-25 10:44:58
合計ジャッジ時間 31,821 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 299 ms
49,904 KB
testcase_01 AC 299 ms
49,948 KB
testcase_02 AC 502 ms
80,636 KB
testcase_03 AC 680 ms
84,744 KB
testcase_04 AC 543 ms
82,760 KB
testcase_05 AC 561 ms
83,904 KB
testcase_06 AC 740 ms
85,008 KB
testcase_07 AC 553 ms
83,836 KB
testcase_08 AC 630 ms
84,732 KB
testcase_09 AC 653 ms
84,540 KB
testcase_10 AC 338 ms
54,384 KB
testcase_11 AC 722 ms
91,216 KB
testcase_12 AC 501 ms
82,236 KB
testcase_13 AC 755 ms
91,996 KB
testcase_14 AC 588 ms
87,640 KB
testcase_15 AC 567 ms
86,384 KB
testcase_16 AC 813 ms
85,304 KB
testcase_17 AC 825 ms
85,384 KB
testcase_18 AC 821 ms
93,500 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.PrintWriter
import java.util.*
import kotlin.math.*

fun PrintWriter.solve() {
    val numCases = nextInt()
    case@ for (_i in 0 until numCases) {
        val n = nextInt()
        val k = nextLong()
        val a = Array(n) { nextLong() }
        var ans = ModInt(1)
        for (i in 0 until n) {
            ans *= ModInt(k).pow((i + 1L) * (a[i] - 1))
            ans *= ModInt(k).pow(i + 1L) - ModInt(1)
        }
        println(ans)
    }
}

// region ModInt
class ModInt(x: Long) {
    companion object {
        const val MOD = 998244353L
        //const val MOD = 1000000007L
    }

    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"
    }
}

class ModIntArray(n: Int) {
    private val a = LongArray(n) { 0L }

    constructor(n: Int, init: (Int) -> ModInt) : this(n) {
        for (i in 0 until n) {
            a[i] = init(i).x
        }
    }

    operator fun set(i: Int, x: ModInt) {
        a[i] = x.x
    }

    operator fun get(i: Int): ModInt {
        return ModInt(a[i])
    }

    fun joinToString(s: String = ", "): String {
        return a.joinToString(s)
    }
}

fun Long.toModInt() = ModInt(this)

fun Int.toModInt() = 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

fun main() {
    Thread(null, {
        val writer = PrintWriter(System.out, false)
        writer.solve()
        writer.flush()
    }, "solve", abs(1L.shl(26)))
        .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } }
        .apply { start() }.join()
}

// 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
0