結果

問題 No.1750 ラムドスウイルスの感染拡大-hard
ユーザー 👑 箱星箱星
提出日時 2022-02-21 22:55:04
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 1,999 ms / 2,000 ms
コード長 4,746 bytes
コンパイル時間 20,455 ms
コンパイル使用メモリ 434,980 KB
実行使用メモリ 58,404 KB
最終ジャッジ日時 2023-09-12 13:35:36
合計ジャッジ時間 47,657 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 278 ms
53,024 KB
testcase_01 AC 279 ms
52,956 KB
testcase_02 AC 278 ms
54,564 KB
testcase_03 AC 286 ms
54,668 KB
testcase_04 AC 435 ms
58,276 KB
testcase_05 AC 276 ms
52,608 KB
testcase_06 AC 282 ms
52,628 KB
testcase_07 AC 277 ms
52,560 KB
testcase_08 AC 643 ms
56,340 KB
testcase_09 AC 654 ms
56,064 KB
testcase_10 AC 652 ms
56,192 KB
testcase_11 AC 589 ms
58,196 KB
testcase_12 AC 671 ms
58,404 KB
testcase_13 AC 657 ms
58,180 KB
testcase_14 AC 1,885 ms
58,084 KB
testcase_15 AC 1,931 ms
56,284 KB
testcase_16 AC 1,945 ms
56,368 KB
testcase_17 AC 1,955 ms
58,196 KB
testcase_18 AC 1,999 ms
58,224 KB
testcase_19 AC 1,927 ms
58,344 KB
testcase_20 AC 1,442 ms
56,568 KB
testcase_21 AC 1,624 ms
56,260 KB
testcase_22 AC 581 ms
56,220 KB
testcase_23 AC 1,846 ms
56,360 KB
testcase_24 AC 541 ms
58,128 KB
testcase_25 AC 754 ms
56,476 KB
testcase_26 AC 466 ms
55,940 KB
testcase_27 AC 345 ms
58,036 KB
testcase_28 AC 349 ms
56,072 KB
testcase_29 AC 300 ms
55,596 KB
testcase_30 AC 608 ms
56,384 KB
testcase_31 AC 595 ms
58,200 KB
testcase_32 AC 593 ms
56,184 KB
testcase_33 AC 593 ms
58,240 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) { ModIntArray(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 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
0