結果
問題 | No.1749 ラムドスウイルスの感染拡大 |
ユーザー | 👑 箱 |
提出日時 | 2021-10-13 13:11:39 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 539 ms / 2,000 ms |
コード長 | 2,831 bytes |
コンパイル時間 | 14,980 ms |
コンパイル使用メモリ | 427,720 KB |
実行使用メモリ | 115,668 KB |
最終ジャッジ日時 | 2023-08-30 06:23:20 |
合計ジャッジ時間 | 26,632 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 266 ms
52,404 KB |
testcase_01 | AC | 269 ms
52,492 KB |
testcase_02 | AC | 265 ms
54,340 KB |
testcase_03 | AC | 269 ms
54,416 KB |
testcase_04 | AC | 340 ms
57,428 KB |
testcase_05 | AC | 265 ms
52,468 KB |
testcase_06 | AC | 262 ms
52,204 KB |
testcase_07 | AC | 269 ms
54,416 KB |
testcase_08 | AC | 274 ms
54,316 KB |
testcase_09 | AC | 270 ms
54,360 KB |
testcase_10 | AC | 417 ms
94,896 KB |
testcase_11 | AC | 415 ms
93,168 KB |
testcase_12 | AC | 539 ms
115,668 KB |
testcase_13 | AC | 276 ms
52,348 KB |
testcase_14 | AC | 307 ms
56,736 KB |
testcase_15 | AC | 327 ms
57,396 KB |
testcase_16 | AC | 329 ms
57,300 KB |
testcase_17 | AC | 377 ms
69,620 KB |
testcase_18 | AC | 483 ms
105,848 KB |
testcase_19 | AC | 466 ms
91,960 KB |
testcase_20 | AC | 303 ms
57,336 KB |
testcase_21 | AC | 301 ms
55,228 KB |
testcase_22 | AC | 277 ms
54,396 KB |
testcase_23 | AC | 276 ms
52,404 KB |
testcase_24 | AC | 282 ms
54,376 KB |
testcase_25 | AC | 352 ms
73,876 KB |
testcase_26 | AC | 316 ms
59,188 KB |
testcase_27 | AC | 315 ms
59,220 KB |
testcase_28 | AC | 350 ms
59,412 KB |
testcase_29 | AC | 357 ms
59,256 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextInt() val m = nextInt() val t = nextInt() val adj = Array(n) { mutableListOf<Int>() } for (i in 0 until m) { val v1 = nextInt() val v2 = nextInt() adj[v1].add(v2) adj[v2].add(v1) } val num = Array(t + 1) { Array(n) { ModInt(0) } } num[0][0] = ModInt(1) for (i in 0 until t) { for (j in 0 until n) { for (k in adj[j]) { num[i + 1][j] += num[i][k] } } } println(num[t][0]) } // region ModInt class ModInt(x: Long) { companion object { //const val MOD = 1000000007L const val MOD = 998244353L } constructor(y: Int) : this(y.toLong()) val x = (x % MOD + MOD) % MOD operator fun plus(other: ModInt): ModInt { return ModInt(x + other.x) } operator fun minus(other: ModInt): ModInt { return ModInt(x - other.x) } operator fun times(other: ModInt): ModInt { return ModInt(x * other.x) } operator fun div(other: ModInt): ModInt { return this * other.inv() } fun pow(exp: Long): ModInt { if (exp == 0L) return ModInt(1L) var a = pow(exp shr 1) a *= a if (exp and 1L == 0L) return a return this * a } fun inv(): ModInt { return this.pow(MOD - 2) } override fun equals(other: Any?): Boolean { if (this === other) return true if (javaClass != other?.javaClass) return false other as ModInt if (x != other.x) return false return true } override fun hashCode(): Int { return x.hashCode() } override fun toString(): String { return "$x" } } fun Long.toModInt(): ModInt { return ModInt(this) } fun Int.toModInt(): ModInt { return ModInt(this) } fun binomSimple(n: Long, k: Long): ModInt { var numer = ModInt(1) var denom = ModInt(1) for (i in 0 until k) { numer *= ModInt(n - i) denom *= ModInt(k - i) } return numer / denom } // endregion fun main() { Thread(null, { val writer = PrintWriter(System.out, false) writer.solve() writer.flush() }, "solve", 1.shl(26)) .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } } .apply { start() }.join() } // region Scanner private var st = StringTokenizer("") private val br = System.`in`.bufferedReader() fun next(): String { while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine()) return st.nextToken() } fun nextInt() = next().toInt() fun nextLong() = next().toLong() fun nextLine() = br.readLine() fun nextDouble() = next().toDouble() // endregion