結果
問題 | No.1810 RGB Biscuits |
ユーザー | yudedako |
提出日時 | 2022-01-25 23:14:14 |
言語 | Scala(Beta) (3.4.0) |
結果 |
AC
|
実行時間 | 1,309 ms / 2,000 ms |
コード長 | 3,647 bytes |
コンパイル時間 | 14,330 ms |
コンパイル使用メモリ | 274,884 KB |
実行使用メモリ | 71,508 KB |
最終ジャッジ日時 | 2024-05-10 00:39:04 |
合計ジャッジ時間 | 40,141 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 849 ms
64,028 KB |
testcase_01 | AC | 871 ms
64,284 KB |
testcase_02 | AC | 866 ms
64,032 KB |
testcase_03 | AC | 933 ms
64,184 KB |
testcase_04 | AC | 939 ms
64,072 KB |
testcase_05 | AC | 1,242 ms
71,508 KB |
testcase_06 | AC | 1,309 ms
65,644 KB |
testcase_07 | AC | 1,291 ms
67,752 KB |
testcase_08 | AC | 1,309 ms
65,388 KB |
testcase_09 | AC | 1,293 ms
68,380 KB |
testcase_10 | AC | 1,248 ms
65,292 KB |
testcase_11 | AC | 952 ms
64,340 KB |
testcase_12 | AC | 955 ms
64,240 KB |
testcase_13 | AC | 978 ms
64,316 KB |
testcase_14 | AC | 1,171 ms
65,112 KB |
testcase_15 | AC | 968 ms
64,080 KB |
testcase_16 | AC | 1,057 ms
64,312 KB |
testcase_17 | AC | 1,265 ms
65,036 KB |
testcase_18 | AC | 1,277 ms
65,124 KB |
testcase_19 | AC | 908 ms
64,048 KB |
testcase_20 | AC | 857 ms
64,032 KB |
testcase_21 | AC | 1,126 ms
64,856 KB |
ソースコード
import scala.io.StdIn.* import ModInt.* 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 asInt(using inline mod: Int): Int = asLong.toInt 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 type Matrix = Array[Array[ModInt]] extension (left: Matrix) inline infix 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)} }} extension (matrix: Matrix) inline def pow(exp: Long)(using inline mod: Int): Matrix = val size = matrix.length var result = Array.tabulate(size){i => Array.tabulate(size){j => if i == j then 1.asModInt else 0.asModInt}} var base = matrix var e = exp 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(a, b) = readLine().split(' ').map(_.toInt.asModInt) val n = readLine().toInt val time = Array.fill(n){readLine().toLong} val initial = Array.tabulate(3){i => if i == 2 then Array(0.asModInt) else Array(1.asModInt)} val oddOperation = Array(Array(1.asModInt, 0.asModInt, 0.asModInt), Array(0.asModInt, 1.asModInt, 0.asModInt), Array(a, b, 1.asModInt)) val evenOperation = Array(Array(0.asModInt, 0.asModInt, 1.asModInt), Array(1.asModInt, 0.asModInt, 0.asModInt), Array(0.asModInt, 0.asModInt, 0.asModInt)) val result = Array.fill(n){0} for (t, i) <- time.zipWithIndex do val operation = if t % 2 == 0 then (evenOperation * oddOperation).pow(t / 2) else oddOperation * (evenOperation * oddOperation).pow(t / 2) val lastState = operation * initial result(i) = lastState.flatten.reduce(_ + _).asInt println(result.mkString("\n"))