結果

問題 No.1620 Substring Sum
ユーザー yudedakoyudedako
提出日時 2022-03-01 16:17:14
言語 Scala(Beta)
(3.4.0)
結果
AC  
実行時間 965 ms / 2,000 ms
コード長 3,159 bytes
コンパイル時間 11,266 ms
コンパイル使用メモリ 266,712 KB
実行使用メモリ 70,080 KB
最終ジャッジ日時 2024-07-07 22:47:34
合計ジャッジ時間 32,789 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 750 ms
63,116 KB
testcase_01 AC 753 ms
62,976 KB
testcase_02 AC 877 ms
63,220 KB
testcase_03 AC 755 ms
63,156 KB
testcase_04 AC 946 ms
69,720 KB
testcase_05 AC 926 ms
70,028 KB
testcase_06 AC 964 ms
69,860 KB
testcase_07 AC 965 ms
69,928 KB
testcase_08 AC 929 ms
70,080 KB
testcase_09 AC 929 ms
69,652 KB
testcase_10 AC 937 ms
69,836 KB
testcase_11 AC 939 ms
69,680 KB
testcase_12 AC 820 ms
63,292 KB
testcase_13 AC 929 ms
69,600 KB
testcase_14 AC 925 ms
69,756 KB
testcase_15 AC 920 ms
69,280 KB
testcase_16 AC 889 ms
66,060 KB
testcase_17 AC 927 ms
69,340 KB
testcase_18 AC 757 ms
63,184 KB
testcase_19 AC 765 ms
63,164 KB
testcase_20 AC 928 ms
69,884 KB
testcase_21 AC 939 ms
69,872 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.PrintWriter
import scala.collection.mutable.*
import scala.io.StdIn.*
import scala.util.chaining.*
import scala.math.*
import scala.reflect.ClassTag
import scala.util.*
import scala.annotation.tailrec
import scala.collection.mutable

object ModInt:
  opaque type ModInt = Long
  inline def zero: ModInt = 0
  inline def one: ModInt = 1
  extension (value: Long)
    inline def toModInt(using inline mod: Int): ModInt =  value % mod
    inline def unsafeAsModInt: ModInt = value
  extension (value: Int)
    inline def toModInt(using inline mod: Int): ModInt = value % mod
    inline def unsafeAsModInt: ModInt = value
  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.toModInt
  inline given Converter[Long] with
    override inline def convert(value: Long)(using inline mod: Int) = value.toModInt
  inline given Converter[ModInt] with
    override inline def convert(value: ModInt)(using inline mod: Int) = value
  extension (modInt: ModInt)
    inline def value(using inline mod: Int): Long = (modInt + mod) % mod
    inline def rawValue: Long = modInt
    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 pow(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 pow(exp: Int)(using inline mod: Int): ModInt = pow(exp.toLong)
  inline def powMod[B: Converter] (base: B, exp: Int)(using inline mod: Int): ModInt = summon[Converter[B]].convert(base).pow(exp)
  inline def powMod[B: Converter] (base: B, exp: Long)(using inline mod: Int): ModInt = summon[Converter[B]].convert(base).pow(exp)
  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)).toModInt
    inline def -(right: R)(using inline mod: Int): ModInt = (summon[Converter[L]].convert(left) - summon[Converter[R]].convert(right)).toModInt
    inline def *(right: R)(using inline mod: Int): ModInt = (summon[Converter[L]].convert(left) * summon[Converter[R]].convert(right)).toModInt
    inline def /(right: R)(using inline mod: Int): ModInt = (summon[Converter[L]].convert(left) * summon[Converter[R]].convert(right).inverse).toModInt

@main def main =
  import ModInt.*
  inline given mod: Int = 998244353
  val str = readLine.map(_ - '0')
  var result = zero
  for (n, i) <- str.zipWithIndex do
    result += powMod(2, i) * powMod(11, str.length - i - 1) * n
  println(result.value)
0