結果
問題 | No.1704 Many Bus Stops (easy) |
ユーザー | 👑 箱 |
提出日時 | 2022-02-21 22:53:15 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 1,173 ms / 2,000 ms |
コード長 | 4,870 bytes |
コンパイル時間 | 19,779 ms |
コンパイル使用メモリ | 441,304 KB |
実行使用メモリ | 59,812 KB |
最終ジャッジ日時 | 2023-09-12 13:34:18 |
合計ジャッジ時間 | 61,536 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 294 ms
55,076 KB |
testcase_01 | AC | 1,151 ms
58,204 KB |
testcase_02 | AC | 665 ms
58,324 KB |
testcase_03 | AC | 667 ms
58,256 KB |
testcase_04 | AC | 669 ms
56,212 KB |
testcase_05 | AC | 669 ms
55,924 KB |
testcase_06 | AC | 668 ms
56,276 KB |
testcase_07 | AC | 672 ms
56,592 KB |
testcase_08 | AC | 668 ms
57,888 KB |
testcase_09 | AC | 668 ms
56,396 KB |
testcase_10 | AC | 666 ms
57,880 KB |
testcase_11 | AC | 669 ms
56,508 KB |
testcase_12 | AC | 670 ms
57,868 KB |
testcase_13 | AC | 665 ms
57,892 KB |
testcase_14 | AC | 671 ms
57,864 KB |
testcase_15 | AC | 668 ms
56,300 KB |
testcase_16 | AC | 669 ms
57,872 KB |
testcase_17 | AC | 670 ms
58,300 KB |
testcase_18 | AC | 667 ms
57,796 KB |
testcase_19 | AC | 668 ms
58,248 KB |
testcase_20 | AC | 670 ms
57,860 KB |
testcase_21 | AC | 668 ms
59,812 KB |
testcase_22 | AC | 1,162 ms
58,132 KB |
testcase_23 | AC | 1,160 ms
58,260 KB |
testcase_24 | AC | 1,165 ms
56,108 KB |
testcase_25 | AC | 1,164 ms
56,156 KB |
testcase_26 | AC | 1,165 ms
58,024 KB |
testcase_27 | AC | 1,164 ms
57,884 KB |
testcase_28 | AC | 1,168 ms
56,220 KB |
testcase_29 | AC | 1,164 ms
58,144 KB |
testcase_30 | AC | 1,166 ms
58,432 KB |
testcase_31 | AC | 1,164 ms
55,896 KB |
testcase_32 | AC | 1,156 ms
58,084 KB |
testcase_33 | AC | 1,157 ms
55,872 KB |
testcase_34 | AC | 1,165 ms
58,252 KB |
testcase_35 | AC | 1,162 ms
56,012 KB |
testcase_36 | AC | 1,163 ms
55,944 KB |
testcase_37 | AC | 1,166 ms
57,876 KB |
testcase_38 | AC | 1,169 ms
56,212 KB |
testcase_39 | AC | 1,161 ms
56,276 KB |
testcase_40 | AC | 1,165 ms
56,156 KB |
testcase_41 | AC | 1,173 ms
58,168 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val numCases = nextInt() val b = arrayOf( arrayOf(1, 0, 0, 0, 1, 1), arrayOf(0, 1, 0, 1, 0, 1), arrayOf(0, 0, 1, 1, 1, 0), arrayOf(3, 0, 0, 0, 0, 0), arrayOf(0, 3, 0, 0, 0, 0), arrayOf(0, 0, 3, 0, 0, 0) ) case@ for (_i in 0 until numCases) { val n = nextLong() val mat = Matrix(b).pow(n).mat val p = mat[3][0] + ModInt(3) * mat[3][3] println(p / ModInt(3).pow(n + 1)) } } // region ModInt class ModInt(x: Long) { companion object { //const val MOD = 998244353L const val MOD = 1000000007L } 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" } } class ModIntArray(n: Int) { private val a = LongArray(n) { 0L } constructor(n: Int, init: (Int) -> ModInt) : this(n) { for (i in 0 until n) { a[i] = init(i).x } } operator fun set(i: Int, x: ModInt) { a[i] = x.x } operator fun get(i: Int): ModInt { return ModInt(a[i]) } fun joinToString(s: String): String { return a.joinToString(s) } } 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 // region Matrix class Matrix(val mat: Array<ModIntArray>) { private val n = mat.size constructor(a: Array<Array<Int>>) : this(Array(a.size) { i -> ModIntArray(a.size) { j -> a[i][j].toModInt() } }) constructor(a: Array<Array<Long>>) : this(Array(a.size) { i -> ModIntArray(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 (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] } } } 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) { ModIntArray(n) { ModInt(0) } }) } fun e(n: Int): Matrix { return Matrix(Array(n) { i -> ModIntArray(n) { j -> ModInt(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