結果
問題 | No.1750 ラムドスウイルスの感染拡大-hard |
ユーザー | yudedako |
提出日時 | 2022-01-26 23:12:49 |
言語 | Scala(Beta) (3.4.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,674 bytes |
コンパイル時間 | 14,675 ms |
コンパイル使用メモリ | 262,108 KB |
実行使用メモリ | 67,520 KB |
最終ジャッジ日時 | 2023-08-25 12:07:20 |
合計ジャッジ時間 | 63,985 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 959 ms
61,844 KB |
testcase_01 | AC | 961 ms
62,588 KB |
testcase_02 | AC | 972 ms
62,028 KB |
testcase_03 | AC | 972 ms
62,548 KB |
testcase_04 | AC | 1,159 ms
62,828 KB |
testcase_05 | AC | 955 ms
61,956 KB |
testcase_06 | AC | 959 ms
62,524 KB |
testcase_07 | AC | 961 ms
63,468 KB |
testcase_08 | AC | 1,312 ms
62,748 KB |
testcase_09 | AC | 1,291 ms
62,616 KB |
testcase_10 | AC | 1,308 ms
62,744 KB |
testcase_11 | AC | 1,315 ms
62,992 KB |
testcase_12 | AC | 1,367 ms
63,128 KB |
testcase_13 | AC | 1,335 ms
62,832 KB |
testcase_14 | AC | 1,995 ms
67,520 KB |
testcase_15 | TLE | - |
testcase_16 | TLE | - |
testcase_17 | TLE | - |
testcase_18 | TLE | - |
testcase_19 | AC | 1,945 ms
62,736 KB |
testcase_20 | AC | 1,723 ms
62,652 KB |
testcase_21 | AC | 1,920 ms
62,884 KB |
testcase_22 | AC | 1,267 ms
62,888 KB |
testcase_23 | AC | 1,990 ms
66,896 KB |
testcase_24 | AC | 1,197 ms
62,508 KB |
testcase_25 | AC | 1,390 ms
62,588 KB |
testcase_26 | AC | 1,180 ms
62,616 KB |
testcase_27 | AC | 1,019 ms
62,452 KB |
testcase_28 | AC | 1,052 ms
62,416 KB |
testcase_29 | AC | 1,028 ms
62,692 KB |
testcase_30 | AC | 1,267 ms
62,992 KB |
testcase_31 | AC | 1,213 ms
62,824 KB |
testcase_32 | AC | 1,215 ms
62,748 KB |
testcase_33 | AC | 1,252 ms
62,744 KB |
ソースコード
import scala.annotation.tailrec import scala.io.StdIn.* import scala.math.* import scala.util.chaining.* object ModInt: opaque type ModInt = Long val zero: ModInt = 0 val 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 = 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.* inline given mod: Int = 998244353 class Matrix private(val row: Int, val column: Int, private val matrix: Array[Array[ModInt]]): def this(row: Int, column: Int) = this(row, column, Array.fill(row){Array.fill(column){ModInt.zero}}) def apply(i: Int, j: Int): ModInt = matrix(i)(j) def update(i: Int, j: Int, value: ModInt) = matrix(i)(j) = value def *(right: Matrix): Matrix = val newRow = row val newColumn = right.column val mid = column Matrix.tabulate(newRow, newColumn){(i, j) => (0 until mid).foldLeft(ModInt.zero){(acc, k) => acc + matrix(i)(k) * right.matrix(k)(j) } } def pow(exp: Long): Matrix = require(row == column) var result = Matrix.e(row, row) var base = this var e = exp while e > 0 do if (e & 1) == 1 then result *= base base *= base e >>= 1 result object Matrix: def tabulate(row: Int, column: Int)(generator: (Int, Int) => ModInt): Matrix = Matrix(row, column, Array.tabulate(row){i => Array.tabulate(column){j => generator(i, j)}}) def e(row: Int, column: Int): Matrix = Matrix.tabulate(row, column){(i, j) => if i == j then ModInt.one else ModInt.zero } @main def main = val (n, m, t) = readLine().split(' ').pipe{case Array(n, m, t) => (n.toInt, m.toInt, t.toLong)} val roads = Array.fill(m){ val Array(u, v) = readLine().split(' ').map(_.toInt) (u, v) } val matrix = Matrix(n, n) for (u, v) <- roads do matrix(u, v) = 1.asModInt matrix(v, u) = 1.asModInt val initial = Matrix(n, 1).tap(m => m(0, 0) = 1.asModInt) val result = matrix.pow(t) * initial println(result(0, 0))