結果
問題 | No.2556 Increasing Matrix |
ユーザー | 👑 箱 |
提出日時 | 2023-09-18 20:45:14 |
言語 | Kotlin (1.9.23) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,098 bytes |
コンパイル時間 | 16,157 ms |
コンパイル使用メモリ | 466,044 KB |
実行使用メモリ | 60,844 KB |
最終ジャッジ日時 | 2023-12-01 23:31:19 |
合計ジャッジ時間 | 32,533 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 329 ms
60,396 KB |
testcase_01 | AC | 335 ms
59,776 KB |
testcase_02 | AC | 330 ms
60,392 KB |
testcase_03 | AC | 326 ms
60,440 KB |
testcase_04 | AC | 322 ms
60,412 KB |
testcase_05 | AC | 323 ms
60,432 KB |
testcase_06 | AC | 328 ms
60,460 KB |
testcase_07 | AC | 324 ms
60,456 KB |
testcase_08 | AC | 332 ms
60,480 KB |
testcase_09 | AC | 366 ms
60,600 KB |
testcase_10 | AC | 345 ms
60,516 KB |
testcase_11 | AC | 362 ms
60,588 KB |
testcase_12 | AC | 347 ms
60,520 KB |
testcase_13 | AC | 403 ms
60,776 KB |
testcase_14 | AC | 528 ms
60,816 KB |
testcase_15 | AC | 504 ms
60,808 KB |
testcase_16 | AC | 457 ms
60,844 KB |
testcase_17 | AC | 562 ms
60,812 KB |
testcase_18 | TLE | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextInt() val a = Array(n) { nextLong() } a.reverse() val l = (0 until n).map { i -> a[i] - i } var numer = ModInt(1) var denom = ModInt(1) for (i in 0 until n) { for (j in i + 1 until n) { numer *= ModInt(l[i] - l[j]) denom *= ModInt(j - i) } } val ssyt = numer / denom println(ssyt * ssyt) } // 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