結果
問題 | No.2156 ぞい文字列 |
ユーザー | 👑 箱 |
提出日時 | 2022-12-09 21:51:35 |
言語 | Kotlin (1.9.10) |
結果 |
AC
|
実行時間 | 276 ms / 2,000 ms |
コード長 | 2,565 bytes |
コンパイル時間 | 18,428 ms |
コンパイル使用メモリ | 435,148 KB |
実行使用メモリ | 54,764 KB |
最終ジャッジ日時 | 2023-08-04 23:24:23 |
合計ジャッジ時間 | 24,806 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 270 ms
54,456 KB |
testcase_01 | AC | 271 ms
54,764 KB |
testcase_02 | AC | 269 ms
54,488 KB |
testcase_03 | AC | 272 ms
54,308 KB |
testcase_04 | AC | 271 ms
54,440 KB |
testcase_05 | AC | 272 ms
54,564 KB |
testcase_06 | AC | 270 ms
52,668 KB |
testcase_07 | AC | 271 ms
52,392 KB |
testcase_08 | AC | 271 ms
54,476 KB |
testcase_09 | AC | 269 ms
52,436 KB |
testcase_10 | AC | 269 ms
54,464 KB |
testcase_11 | AC | 273 ms
54,336 KB |
testcase_12 | AC | 276 ms
52,528 KB |
testcase_13 | AC | 272 ms
54,344 KB |
testcase_14 | AC | 272 ms
54,272 KB |
testcase_15 | AC | 273 ms
52,496 KB |
testcase_16 | AC | 271 ms
54,324 KB |
testcase_17 | AC | 271 ms
52,456 KB |
testcase_18 | AC | 274 ms
52,664 KB |
testcase_19 | AC | 276 ms
52,476 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextLong() val a = Array(2) { LongArray(2) { 1L } } a[1][1] = 0 val mat = Matrix(a) var ans = mat.pow(n).mat[0][0] - 1 if (ans < 0) ans += MOD println(ans) } // region Matrix const val MOD = 998244353L // const val MOD = 1000000007L 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", abs(1L.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