結果
問題 | No.2197 Same Dish |
ユーザー | 👑 箱 |
提出日時 | 2022-09-19 18:20:29 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 996 ms / 2,000 ms |
コード長 | 2,612 bytes |
コンパイル時間 | 16,073 ms |
コンパイル使用メモリ | 434,932 KB |
実行使用メモリ | 65,876 KB |
最終ジャッジ日時 | 2023-09-05 13:06:19 |
合計ジャッジ時間 | 30,821 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 300 ms
55,600 KB |
testcase_01 | AC | 309 ms
55,928 KB |
testcase_02 | AC | 302 ms
55,548 KB |
testcase_03 | AC | 303 ms
55,924 KB |
testcase_04 | AC | 301 ms
55,604 KB |
testcase_05 | AC | 301 ms
55,552 KB |
testcase_06 | AC | 307 ms
55,692 KB |
testcase_07 | AC | 304 ms
55,588 KB |
testcase_08 | AC | 306 ms
55,628 KB |
testcase_09 | AC | 301 ms
55,576 KB |
testcase_10 | AC | 310 ms
55,712 KB |
testcase_11 | AC | 322 ms
55,876 KB |
testcase_12 | AC | 324 ms
55,892 KB |
testcase_13 | AC | 551 ms
58,268 KB |
testcase_14 | AC | 918 ms
63,888 KB |
testcase_15 | AC | 951 ms
65,544 KB |
testcase_16 | AC | 793 ms
61,300 KB |
testcase_17 | AC | 773 ms
63,964 KB |
testcase_18 | AC | 959 ms
65,696 KB |
testcase_19 | AC | 955 ms
65,876 KB |
testcase_20 | AC | 967 ms
65,496 KB |
testcase_21 | AC | 952 ms
65,724 KB |
testcase_22 | AC | 996 ms
65,876 KB |
ソースコード
fun main() { val (n, k) = nextInts() val customers = mutableListOf<Pair<Int, Int>>() for (i in 0 until n) { val (l, r) = nextInts() customers.add(l to r) } customers.sortBy { it.first } val bit = BIT(200005) var compl = ModInt(1) for ((l, r) in customers) { compl *= ModInt(k - bit.sum(l + 1 until 200005)) bit.add(r, 1) } val ans = ModInt(k).pow(n.toLong()) - compl println(ans) } class BIT(private val n: Int) { private val data = LongArray(n) { 0 } fun add(i: Int, x: Long) { var p = i + 1 while (p <= n) { data[p - 1] += x p += p and -p } } fun sum(range: IntRange): Long { val l = range.first val r = range.last + 1 return sum(r) - sum(l) } private fun sum(i: Int): Long { var r = i var s = 0L while(r > 0) { s += data[r - 1] r -= r and -r } return s } } // 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) } 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 nextInts() = readln().split(" ").map { it.toInt() }