結果

問題 No.1049 Zero (Exhaust)
コンテスト
ユーザー yudedako
提出日時 2022-01-26 17:39:32
言語 Scala(Beta)
(3.6.2)
結果
AC  
実行時間 1,146 ms / 2,000 ms
コード長 2,999 bytes
コンパイル時間 15,383 ms
コンパイル使用メモリ 273,348 KB
実行使用メモリ 63,728 KB
最終ジャッジ日時 2024-12-23 09:49:56
合計ジャッジ時間 43,366 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff # 

import scala.annotation.tailrec
import scala.io.StdIn.*
import scala.math.*
object ModInt:
  opaque type ModInt = Long
  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 = modInt.powMod(mod - 2)
    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

import ModInt.*
type Matrix = Array[Array[ModInt]]

extension (left: Matrix)
  inline def *(right: Matrix)(using inline mod: Int): Matrix =
    val row = left.length
    val column = right(0).length
    val mid = right.length
    Array.tabulate(row){i =>
      Array.tabulate(column){j =>
        (0 until mid).foldLeft(0.asModInt){(acc, k) => acc + left(i)(k) * right(k)(j)}
      }
    }
  inline def pow(exp: Int)(using inline mod: Int): Matrix =
    var result = Array.tabulate(left.length){i => Array.tabulate(left.length){j => if i == j then 1.asModInt else 0.asModInt}}
    var e = exp
    var base = left
    while e > 0 do
      if (e & 1) == 1 then
        result = result * base
      base = base * base
      e = e >> 1
    result

@main def main =
  inline given mod: Int = 1000000007
  val Array(p, k) = readLine().split(' ').map(_.toInt)
  val init = Array(Array(1.asModInt), Array(2.asModInt))
  val op = Array(Array((p - 1).asModInt, 1.asModInt), Array(0.asModInt, 2 * p.asModInt))
  val Array(Array(result), _) = op.pow(k) * init
  println(result)
0