結果

問題 No.1704 Many Bus Stops (easy)
ユーザー 👑 箱箱
提出日時 2021-10-17 22:42:42
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 1,168 ms / 2,000 ms
コード長 4,387 bytes
コンパイル時間 22,105 ms
コンパイル使用メモリ 464,612 KB
実行使用メモリ 59,636 KB
最終ジャッジ日時 2023-10-17 22:35:55
合計ジャッジ時間 56,825 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 305 ms
55,904 KB
testcase_01 AC 1,116 ms
59,572 KB
testcase_02 AC 669 ms
59,496 KB
testcase_03 AC 671 ms
59,568 KB
testcase_04 AC 672 ms
59,564 KB
testcase_05 AC 671 ms
59,504 KB
testcase_06 AC 669 ms
59,488 KB
testcase_07 AC 667 ms
59,564 KB
testcase_08 AC 674 ms
59,500 KB
testcase_09 AC 674 ms
59,564 KB
testcase_10 AC 680 ms
59,516 KB
testcase_11 AC 679 ms
59,552 KB
testcase_12 AC 672 ms
59,492 KB
testcase_13 AC 679 ms
59,500 KB
testcase_14 AC 685 ms
59,552 KB
testcase_15 AC 690 ms
59,512 KB
testcase_16 AC 674 ms
59,564 KB
testcase_17 AC 680 ms
59,504 KB
testcase_18 AC 682 ms
59,496 KB
testcase_19 AC 678 ms
59,568 KB
testcase_20 AC 667 ms
59,504 KB
testcase_21 AC 668 ms
59,508 KB
testcase_22 AC 1,119 ms
59,508 KB
testcase_23 AC 1,120 ms
59,508 KB
testcase_24 AC 1,118 ms
59,508 KB
testcase_25 AC 1,131 ms
59,572 KB
testcase_26 AC 1,113 ms
59,496 KB
testcase_27 AC 1,111 ms
59,492 KB
testcase_28 AC 1,120 ms
59,636 KB
testcase_29 AC 1,168 ms
59,564 KB
testcase_30 AC 1,104 ms
59,564 KB
testcase_31 AC 1,101 ms
59,568 KB
testcase_32 AC 1,119 ms
59,576 KB
testcase_33 AC 1,128 ms
59,576 KB
testcase_34 AC 1,137 ms
59,508 KB
testcase_35 AC 1,132 ms
59,560 KB
testcase_36 AC 1,123 ms
59,568 KB
testcase_37 AC 1,121 ms
59,492 KB
testcase_38 AC 1,119 ms
59,512 KB
testcase_39 AC 1,125 ms
59,500 KB
testcase_40 AC 1,120 ms
59,524 KB
testcase_41 AC 1,130 ms
59,564 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.PrintWriter
import java.util.*

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 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 (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) { 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
0