結果

問題 No.1836 Max Matrix
ユーザー yudedakoyudedako
提出日時 2022-02-21 23:27:53
言語 Scala(Beta)
(3.4.0)
結果
AC  
実行時間 887 ms / 2,000 ms
コード長 2,940 bytes
コンパイル時間 11,313 ms
コンパイル使用メモリ 268,812 KB
実行使用メモリ 63,388 KB
最終ジャッジ日時 2024-06-30 02:03:31
合計ジャッジ時間 26,206 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 787 ms
63,032 KB
testcase_01 AC 775 ms
63,112 KB
testcase_02 AC 869 ms
63,184 KB
testcase_03 AC 882 ms
63,232 KB
testcase_04 AC 869 ms
63,212 KB
testcase_05 AC 848 ms
63,260 KB
testcase_06 AC 832 ms
63,120 KB
testcase_07 AC 849 ms
63,288 KB
testcase_08 AC 808 ms
63,224 KB
testcase_09 AC 887 ms
63,256 KB
testcase_10 AC 855 ms
62,912 KB
testcase_11 AC 786 ms
63,344 KB
testcase_12 AC 868 ms
63,216 KB
testcase_13 AC 818 ms
63,200 KB
testcase_14 AC 855 ms
63,388 KB
testcase_15 AC 850 ms
63,344 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import scala.collection.mutable
import scala.collection.mutable.ArrayBuffer
import scala.io.StdIn.*
import scala.util.chaining.*
import scala.math.*
import scala.reflect.{ClassTag, classTag}
import scala.util.*
import scala.annotation.tailrec
object ModInt:
  opaque type ModInt = Long
  inline def zero: ModInt = 0
  inline def one: ModInt = 1
  extension (value: Long)
    inline def asModInt(using inline mod: Int): ModInt =  value % mod
  extension (value: Int)
    inline def asModInt(using inline mod: Int): ModInt = value % mod
  trait Converter[T]:
    inline def convert(value: T)(using inline mod: Int): ModInt
  inline given Converter[Int] with
    override inline def convert(value: Int)(using inline mod: Int) = value.asModInt
  inline given Converter[Long] with
    override inline def convert(value: Long)(using inline mod: Int) = value.asModInt
  inline given Converter[ModInt] with
    override inline def convert(value: ModInt)(using inline mod: Int) = value
  extension (modInt: ModInt)
    inline def asLong(using inline mod: Int): Long = (modInt + mod) % mod
    inline def inverse(using inline mod: Int): ModInt =
      var x = modInt
      var y = mod.toLong
      var a = 1L
      var b = 0L
      var c = 0L
      var d = 1L
      while y != 0 do
        val q = x / y
        val e = a - c * q
        val f = b - d * q
        a = c
        b = d
        c = e
        d = f
        x = y
        y = c * modInt + d * mod
      require(x.abs == 1L)
      if x == 1 then a % mod else -a % mod
    inline def powMod(exp: Long)(using inline mod: Int): ModInt =
      var result = 1L
      var base = modInt
      var e = exp
      while e > 0 do
        if (e & 1) == 1 then
          result = result * base % mod
        base = base * base % mod
        e >>= 1
      result
    inline def powMod(exp: Int)(using inline mod: Int): ModInt = powMod(exp.toLong)
  extension [L: Converter, R: Converter] (left: L)
    inline def +(right: R)(using inline mod: Int): ModInt = (summon[Converter[L]].convert(left) + summon[Converter[R]].convert(right)).asModInt
    inline def -(right: R)(using inline mod: Int): ModInt = (summon[Converter[L]].convert(left) - summon[Converter[R]].convert(right)).asModInt
    inline def *(right: R)(using inline mod: Int): ModInt = (summon[Converter[L]].convert(left) * summon[Converter[R]].convert(right)).asModInt
    inline def /(right: R)(using inline mod: Int): ModInt = (summon[Converter[L]].convert(left) * summon[Converter[R]].convert(right).inverse).asModInt


@main def main =
  import ModInt.*
  inline given MOD: Int = 998244353
  val Array(height, width, valueMax) = readLine.split(' ').map(_.toInt)
  var result = ModInt.zero
  for min <- 1 to valueMax do
    result += ((valueMax - min + 1).asModInt.powMod(height) - (valueMax - min).asModInt.powMod(height)) * ((valueMax - min + 1).asModInt.powMod(width) - (valueMax - min).asModInt.powMod(width))
  println(result.asLong)
0