結果
問題 |
No.1749 ラムドスウイルスの感染拡大
|
ユーザー |
|
提出日時 | 2022-01-25 00:00:26 |
言語 | Scala(Beta) (3.6.2) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,584 bytes |
コンパイル時間 | 15,705 ms |
コンパイル使用メモリ | 281,996 KB |
実行使用メモリ | 69,992 KB |
最終ジャッジ日時 | 2025-02-20 09:04:50 |
合計ジャッジ時間 | 22,504 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | TLE * 1 -- * 3 |
other | -- * 26 |
ソースコード
import scala.io.StdIn.* 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: Int)(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: 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 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(n, m, t) = readLine().split(' ').map(_.toInt) val roads = Array.fill(m){ val Array(u, v) = readLine().split(' ').map(_.toInt) (u, v) } val current = Array.fill(n){0.asModInt} current(0) = 1.asModInt for _ <- 0 until t do val next = Array.fill(n){0.asModInt} for (u, v) <- roads do next(v) += current(u) next(u) += current(v) next.copyToArray(current) println(current(0).asLong)