結果
問題 | No.1750 ラムドスウイルスの感染拡大-hard |
ユーザー | 👑 箱星 |
提出日時 | 2021-10-18 07:38:20 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 458 ms / 2,000 ms |
コード長 | 2,656 bytes |
コンパイル時間 | 16,401 ms |
コンパイル使用メモリ | 425,848 KB |
実行使用メモリ | 59,564 KB |
最終ジャッジ日時 | 2023-08-30 06:25:50 |
合計ジャッジ時間 | 30,244 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 279 ms
52,356 KB |
testcase_01 | AC | 295 ms
52,480 KB |
testcase_02 | AC | 280 ms
54,304 KB |
testcase_03 | AC | 268 ms
54,404 KB |
testcase_04 | AC | 351 ms
54,904 KB |
testcase_05 | AC | 274 ms
54,416 KB |
testcase_06 | AC | 268 ms
52,604 KB |
testcase_07 | AC | 268 ms
54,404 KB |
testcase_08 | AC | 334 ms
54,960 KB |
testcase_09 | AC | 328 ms
52,904 KB |
testcase_10 | AC | 325 ms
53,192 KB |
testcase_11 | AC | 335 ms
52,988 KB |
testcase_12 | AC | 347 ms
53,096 KB |
testcase_13 | AC | 347 ms
54,852 KB |
testcase_14 | AC | 458 ms
59,564 KB |
testcase_15 | AC | 458 ms
57,424 KB |
testcase_16 | AC | 458 ms
55,536 KB |
testcase_17 | AC | 452 ms
55,600 KB |
testcase_18 | AC | 450 ms
55,512 KB |
testcase_19 | AC | 446 ms
55,608 KB |
testcase_20 | AC | 412 ms
57,524 KB |
testcase_21 | AC | 428 ms
55,832 KB |
testcase_22 | AC | 343 ms
54,880 KB |
testcase_23 | AC | 452 ms
57,768 KB |
testcase_24 | AC | 345 ms
53,196 KB |
testcase_25 | AC | 356 ms
55,472 KB |
testcase_26 | AC | 327 ms
54,728 KB |
testcase_27 | AC | 308 ms
53,020 KB |
testcase_28 | AC | 309 ms
54,656 KB |
testcase_29 | AC | 274 ms
54,388 KB |
testcase_30 | AC | 369 ms
56,880 KB |
testcase_31 | AC | 367 ms
55,352 KB |
testcase_32 | AC | 367 ms
52,884 KB |
testcase_33 | AC | 365 ms
52,904 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextInt() val m = nextInt() val t = nextLong() val adj = Array(n) { LongArray(n) { 0 } } for (i in 0 until m) { val u = nextInt() val v = nextInt() adj[u][v] = 1 adj[v][u] = 1 } val mat = Matrix(adj) val pow = mat.pow(t).mat println(pow[0][0]) } const val MOD = 998244353L // region Matrix class Matrix(val mat: Array<LongArray>) { private val n = mat.size operator fun plus(other: Matrix): Matrix { val b = mat.copyOf() for (i in 0 until n) { for (j in 0 until n) { b[i][j] += other.mat[i][j] b[i][j] %= MOD } } return Matrix(b) } operator fun minus(other: Matrix): Matrix { val b = mat.copyOf() for (i in 0 until n) { for (j in 0 until n) { b[i][j] -= other.mat[i][j] b[i][j] %= MOD b[i][j] += MOD b[i][j] %= MOD } } return Matrix(b) } operator fun times(other: Matrix): Matrix { val b = zero(n).mat for (k in 0 until n) { for (i in 0 until n) { for (j in 0 until n) { b[i][j] += mat[i][k] * other.mat[k][j] b[i][j] %= MOD } } } return Matrix(b) } fun pow(exp: Long): Matrix { if (exp == 0L) return e(n) var a = pow(exp shr 1) a *= a if (exp and 1L == 0L) return a return this * a } override fun toString(): String { return mat.joinToString("\n") { "[${it.joinToString()}]" } } } fun zero(n: Int): Matrix { return Matrix(Array(n) { LongArray(n) { 0 } }) } fun e(n: Int): Matrix { return Matrix(Array(n) { i -> LongArray(n) { j -> if (i == j) 1 else 0 } }) } // 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