結果

問題 No.2381 Gift Exchange Party
ユーザー 箱星箱星
提出日時 2023-04-21 15:25:27
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 527 ms / 2,000 ms
コード長 3,562 bytes
コンパイル時間 12,854 ms
コンパイル使用メモリ 450,032 KB
実行使用メモリ 144,680 KB
最終ジャッジ日時 2024-05-02 02:40:48
合計ジャッジ時間 24,389 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 391 ms
140,404 KB
testcase_01 AC 419 ms
138,196 KB
testcase_02 AC 393 ms
140,264 KB
testcase_03 AC 415 ms
138,076 KB
testcase_04 AC 398 ms
140,064 KB
testcase_05 AC 395 ms
140,292 KB
testcase_06 AC 397 ms
140,440 KB
testcase_07 AC 402 ms
138,380 KB
testcase_08 AC 389 ms
140,096 KB
testcase_09 AC 386 ms
140,172 KB
testcase_10 AC 408 ms
138,324 KB
testcase_11 AC 392 ms
140,184 KB
testcase_12 AC 413 ms
138,048 KB
testcase_13 AC 397 ms
140,444 KB
testcase_14 AC 423 ms
138,112 KB
testcase_15 AC 423 ms
140,316 KB
testcase_16 AC 404 ms
140,084 KB
testcase_17 AC 410 ms
140,000 KB
testcase_18 AC 409 ms
140,408 KB
testcase_19 AC 402 ms
140,084 KB
testcase_20 AC 525 ms
144,624 KB
testcase_21 AC 403 ms
140,488 KB
testcase_22 AC 527 ms
144,680 KB
testcase_23 AC 525 ms
144,480 KB
testcase_24 AC 403 ms
140,104 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

fun PrintWriter.solve() {
    val n = nextLong()
    val p = nextLong()
    var ans = ModInt(0)
    val cc = CombinationCalculator()
    for (k in 0..n / p) {
        ans += cc.fac(n) / (cc.fac(k) * cc.fac(n - k * p) * ModInt(p).pow(k))
    }
    println(cc.fac(n) - 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"
    }
}

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() {
    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