結果
問題 | No.2156 ぞい文字列 |
ユーザー | 👑 箱星 |
提出日時 | 2022-12-09 21:51:35 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 259 ms / 2,000 ms |
コード長 | 2,565 bytes |
コンパイル時間 | 18,405 ms |
コンパイル使用メモリ | 453,984 KB |
実行使用メモリ | 58,704 KB |
最終ジャッジ日時 | 2024-04-22 21:47:47 |
合計ジャッジ時間 | 20,821 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 244 ms
58,472 KB |
testcase_01 | AC | 246 ms
58,472 KB |
testcase_02 | AC | 245 ms
58,392 KB |
testcase_03 | AC | 250 ms
58,580 KB |
testcase_04 | AC | 249 ms
58,584 KB |
testcase_05 | AC | 250 ms
58,584 KB |
testcase_06 | AC | 245 ms
58,464 KB |
testcase_07 | AC | 246 ms
58,556 KB |
testcase_08 | AC | 248 ms
58,468 KB |
testcase_09 | AC | 251 ms
58,704 KB |
testcase_10 | AC | 248 ms
58,380 KB |
testcase_11 | AC | 250 ms
58,688 KB |
testcase_12 | AC | 250 ms
58,580 KB |
testcase_13 | AC | 255 ms
58,476 KB |
testcase_14 | AC | 259 ms
58,448 KB |
testcase_15 | AC | 245 ms
58,464 KB |
testcase_16 | AC | 249 ms
58,484 KB |
testcase_17 | AC | 256 ms
58,576 KB |
testcase_18 | AC | 254 ms
58,440 KB |
testcase_19 | AC | 247 ms
58,404 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