結果
問題 | No.1750 ラムドスウイルスの感染拡大-hard |
ユーザー | 👑 箱星 |
提出日時 | 2021-10-17 22:09:31 |
言語 | Kotlin (1.9.23) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 4,234 bytes |
コンパイル時間 | 17,154 ms |
コンパイル使用メモリ | 432,696 KB |
実行使用メモリ | 77,164 KB |
最終ジャッジ日時 | 2023-08-30 06:26:47 |
合計ジャッジ時間 | 50,980 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 281 ms
54,332 KB |
testcase_01 | AC | 280 ms
52,460 KB |
testcase_02 | AC | 289 ms
52,476 KB |
testcase_03 | AC | 284 ms
54,240 KB |
testcase_04 | AC | 400 ms
59,160 KB |
testcase_05 | AC | 282 ms
52,500 KB |
testcase_06 | AC | 284 ms
52,464 KB |
testcase_07 | AC | 286 ms
54,316 KB |
testcase_08 | AC | 693 ms
59,632 KB |
testcase_09 | AC | 700 ms
60,060 KB |
testcase_10 | AC | 694 ms
59,624 KB |
testcase_11 | AC | 616 ms
61,648 KB |
testcase_12 | AC | 716 ms
62,092 KB |
testcase_13 | AC | 703 ms
59,792 KB |
testcase_14 | TLE | - |
testcase_15 | TLE | - |
testcase_16 | TLE | - |
testcase_17 | TLE | - |
testcase_18 | TLE | - |
testcase_19 | TLE | - |
testcase_20 | AC | 1,617 ms
55,896 KB |
testcase_21 | AC | 1,868 ms
57,892 KB |
testcase_22 | AC | 582 ms
55,748 KB |
testcase_23 | TLE | - |
testcase_24 | AC | 542 ms
57,404 KB |
testcase_25 | AC | 816 ms
55,416 KB |
testcase_26 | AC | 478 ms
55,628 KB |
testcase_27 | AC | 325 ms
57,372 KB |
testcase_28 | AC | 332 ms
57,468 KB |
testcase_29 | AC | 295 ms
55,056 KB |
testcase_30 | AC | 600 ms
56,028 KB |
testcase_31 | AC | 588 ms
55,612 KB |
testcase_32 | AC | 587 ms
55,756 KB |
testcase_33 | AC | 583 ms
57,600 KB |
ソースコード
import java.io.PrintWriter import java.util.* fun PrintWriter.solve() { val n = nextInt() val m = nextInt() val t = nextLong() val adj = Array(n) { Array(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]) } // region Matrix class Matrix(val mat: Array<Array<ModInt>>) { private val n = mat.size constructor(a: Array<Array<Int>>) : this(Array(a.size) { i -> Array(a.size) { j -> a[i][j].toModInt() } }) constructor(a: Array<Array<Long>>) : this(Array(a.size) { i -> Array(a.size) { j -> a[i][j].toModInt() } }) 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] } } 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] } } return Matrix(b) } operator fun times(other: Matrix): Matrix { val b = zero(n).mat for (i in 0 until n) { for (j in 0 until n) { for (k in 0 until n) { b[i][j] += mat[i][k] * other.mat[k][j] } } } 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) { Array(n) { ModInt(0) } }) } fun e(n: Int): Matrix { return Matrix(Array(n) { i -> Array(n) { j -> ModInt(if (i == j) 1 else 0) } }) } // endregion // 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