結果

問題 No.1750 ラムドスウイルスの感染拡大-hard
ユーザー 👑 箱箱
提出日時 2021-10-17 22:11:07
言語 Kotlin
(1.9.23)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,277 bytes
コンパイル時間 18,644 ms
コンパイル使用メモリ 439,348 KB
実行使用メモリ 77,424 KB
最終ジャッジ日時 2023-08-30 06:27:59
合計ジャッジ時間 50,859 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 266 ms
54,652 KB
testcase_01 AC 268 ms
54,432 KB
testcase_02 AC 271 ms
52,540 KB
testcase_03 AC 268 ms
54,632 KB
testcase_04 AC 384 ms
57,620 KB
testcase_05 AC 267 ms
54,296 KB
testcase_06 AC 271 ms
54,512 KB
testcase_07 AC 274 ms
54,472 KB
testcase_08 AC 630 ms
61,628 KB
testcase_09 AC 637 ms
59,764 KB
testcase_10 AC 644 ms
61,664 KB
testcase_11 AC 565 ms
59,892 KB
testcase_12 AC 659 ms
61,720 KB
testcase_13 AC 645 ms
61,788 KB
testcase_14 TLE -
testcase_15 TLE -
testcase_16 TLE -
testcase_17 TLE -
testcase_18 TLE -
testcase_19 TLE -
testcase_20 AC 1,461 ms
59,804 KB
testcase_21 AC 1,634 ms
63,824 KB
testcase_22 AC 534 ms
55,800 KB
testcase_23 AC 1,942 ms
75,744 KB
testcase_24 AC 496 ms
57,936 KB
testcase_25 AC 719 ms
57,724 KB
testcase_26 AC 440 ms
57,504 KB
testcase_27 AC 306 ms
57,552 KB
testcase_28 AC 322 ms
57,388 KB
testcase_29 AC 288 ms
57,464 KB
testcase_30 AC 565 ms
56,080 KB
testcase_31 AC 540 ms
56,160 KB
testcase_32 AC 540 ms
57,628 KB
testcase_33 AC 541 ms
55,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.PrintWriter
import java.util.*
import kotlin.math.*

fun PrintWriter.solve() {
    val n = nextInt()
    val m = nextInt()
    val t = nextLong()
    val adj = Array(n) { Array(n) { ModInt(0) } }
    for (i in 0 until m) {
        val u = nextInt()
        val v = nextInt()
        adj[u][v] = ModInt(1)
        adj[v][u] = ModInt(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 (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