結果

問題 No.1442 I-wate Shortest Path Problem
ユーザー first_vilfirst_vil
提出日時 2021-03-11 03:29:51
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 2,649 ms / 3,000 ms
コード長 4,928 bytes
コンパイル時間 24,490 ms
コンパイル使用メモリ 467,588 KB
実行使用メモリ 126,804 KB
最終ジャッジ日時 2024-04-20 20:21:54
合計ジャッジ時間 65,259 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 334 ms
50,288 KB
testcase_01 AC 340 ms
49,944 KB
testcase_02 AC 546 ms
56,444 KB
testcase_03 AC 792 ms
74,648 KB
testcase_04 AC 533 ms
57,832 KB
testcase_05 AC 445 ms
53,500 KB
testcase_06 AC 810 ms
74,088 KB
testcase_07 AC 508 ms
56,688 KB
testcase_08 AC 733 ms
72,284 KB
testcase_09 AC 590 ms
59,584 KB
testcase_10 AC 835 ms
77,428 KB
testcase_11 AC 790 ms
73,900 KB
testcase_12 AC 2,257 ms
124,504 KB
testcase_13 AC 1,136 ms
105,388 KB
testcase_14 AC 1,934 ms
123,880 KB
testcase_15 AC 1,571 ms
108,004 KB
testcase_16 AC 1,939 ms
117,500 KB
testcase_17 AC 2,649 ms
119,612 KB
testcase_18 AC 2,442 ms
117,516 KB
testcase_19 AC 2,126 ms
124,048 KB
testcase_20 AC 2,523 ms
119,552 KB
testcase_21 AC 2,447 ms
119,432 KB
testcase_22 AC 1,122 ms
104,484 KB
testcase_23 AC 2,146 ms
126,804 KB
testcase_24 AC 993 ms
104,516 KB
testcase_25 AC 2,133 ms
119,464 KB
testcase_26 AC 1,398 ms
104,896 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.kt:77:13: warning: name shadowed: a
        var a = x
            ^
Main.kt:78:13: warning: name shadowed: b
        var b = y
            ^
Main.kt:132:10: warning: name shadowed: x
    for (x in ans) println(x)
         ^
Main.kt:179:24: warning: 'toByte(): Byte' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
        while (b < '0'.toByte() || b > '9'.toByte()) b = readByte()
                       ^
Main.kt:179:44: warning: 'toByte(): Byte' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
        while (b < '0'.toByte() || b > '9'.toByte()) b = readByte()
                                           ^
Main.kt:180:20: warning: 'toByte(): Byte' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
        while ('0'.toByte() <= b && b <= '9'.toByte()) {
                   ^
Main.kt:180:46: warning: 'toByte(): Byte' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
        while ('0'.toByte() <= b && b <= '9'.toByte()) {
                                             ^
Main.kt:182:26: warning: 'toByte(): Byte' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
            n += b - '0'.toByte()
                         ^

ソースコード

diff # 

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

fun PrintWriter.solve() {
    val scan=FastScanner()

    val n = scan.nextInt()
    val k = scan.nextInt()

    //Making Graph-begin
    val cnt = IntArray(n + k)
    val a = IntArray(n - 1)
    val b = IntArray(n - 1)
    val c = IntArray(n - 1)
    for (i in 0 until n - 1) {
        a[i] = scan.nextInt() - 1
        b[i] = scan.nextInt() - 1
        c[i] = scan.nextInt()
        ++cnt[a[i]]
        ++cnt[b[i]]
    }

    val m = IntArray(k)
    val p = IntArray(k)
    val x = Array(k) {IntArray(0)}
    for (i in 0 until k) {
        m[i] = scan.nextInt()
        p[i] = scan.nextInt()
        cnt[n + i] += m[i]
        x[i] = IntArray(m[i]) { scan.nextInt() - 1 }
        for (j in x[i]) ++cnt[j]
    }

    val g = Array(n + k) { Array(0) { Pair<Int, Int>(0, 0) } }
    for (i in 0 until n + k) g[i] = Array(cnt[i]) { Pair<Int, Int>(0, 0) }
    for (i in 0 until n - 1) {
        g[a[i]][--cnt[a[i]]] = Pair<Int, Int>(b[i], c[i])
        g[b[i]][--cnt[b[i]]] = Pair<Int, Int>(a[i], c[i])
    }
    for (i in 0 until k) {
        for (j in x[i]) {
            g[n + i][--cnt[n + i]] = Pair<Int, Int>(j, 0)
            g[j][--cnt[j]] = Pair<Int, Int>(n + i, p[i])
        }
    }
    //Making Graph-end

    //LCA-begin
    val logn = 16
    val dep = Array(n) { -1 }
    val dis = LongArray(n) { 0 }
    val nxt = Array(logn + 1) { Array(n) { -1 } }
    val que = ArrayDeque<Int>()
    dep[0] = 0
    que.addLast(0)
    while (que.isNotEmpty()) {
        val cur = que.pollFirst()
        for ((to, cost) in g[cur]) {
            if (to < n && dep[to] == -1) {
                dep[to] = dep[cur] + 1
                dis[to] = dis[cur] + cost
                nxt[0][to] = cur
                que.addLast(to)
            }
        }
    }

    for (j in 0 until logn) {
        for (i in 0 until n) {
            if (nxt[j][i] != -1) {
                nxt[j + 1][i] = nxt[j][nxt[j][i]]
            }
        }
    }

    fun lca(x: Int, y: Int): Int {
        var a = x
        var b = y
        if (dep[a] > dep[b]) {
            a = y
            b = x
        }
        val d = dep[b] - dep[a]
        for (j in logn downTo 0) {
            if (d and (1 shl j) > 0) b = nxt[j][b]
        }
        if (a == b) return a
        for (j in logn downTo 0) {
            if (nxt[j][a] != nxt[j][b]) {
                a = nxt[j][a]
                b = nxt[j][b]
            }
        }
        return nxt[0][a]
    }
    //LCA-end

    val q = scan.nextInt()
    val ans = Array(q) { 0L }
    val u = Array(q) { 0 }
    val v = Array(q) { 0 }
    for (i in 0 until q) {
        u[i] = scan.nextInt() - 1
        v[i] = scan.nextInt() - 1
        ans[i] = dis[u[i]] + dis[v[i]] - 2 * dis[lca(u[i], v[i])]
    }

    //Dijkstra-begin
    val pq = PriorityQueue<Pair<Long, Int>>(compareBy {it.first})
    for (i in 0 until k) {
        val dp = LongArray(n + k) { 1000000000000000000L }
        dp[n + i] = 0
        pq.add(Pair<Long,Int>(0L,n + i))
        while (pq.isNotEmpty()) {
            val (d,cur) = pq.remove()
            if (dp[cur] < d) continue
            for ((to, cost) in g[cur]) {
                if (dp[to] > d + cost) {
                    dp[to] = d + cost
                    pq.add(Pair<Long,Int>(d + cost, to))
                }
            }
        }
        for (j in 0 until q) {
            if (ans[j] > dp[u[j]] + dp[v[j]] + p[i]) {
                ans[j] = dp[u[j]] + dp[v[j]] + p[i]
            }
        }
    }
    //Dijkstra-end

    for (x in ans) println(x)
}

fun main() {
    val writer = PrintWriter(System.out, false)
    writer.solve()
    writer.flush()
}

private class FastScanner {
    private val printable = 33..126
    val `in` = System.`in`
    val buffer = ByteArray(65536)
    var ptr = 0
    var buflen = 0
    fun hasNextByte(): Boolean {
        if (ptr < buflen) {
            return true
        } else {
            ptr = 0
            buflen = `in`.read(buffer)
            if (buflen <= 0) {
                return false
            }
        }
        return true
    }
    fun readByte(): Byte {
        return if (hasNextByte()) buffer[ptr++] else return -1
    }
    fun hasNext(): Boolean {
        while (hasNextByte() && buffer[ptr] !in printable) ptr++
        return hasNextByte()
    }
    fun next(): String {
        val sb = StringBuilder()
        var b = readByte()
        while (b in printable) {
            sb.appendCodePoint(b.toInt())
            b = readByte()
        }
        return sb.toString()
    }
    fun nextInt(): Int {
        var n = 0
        var b = readByte()
        
        while (b < '0'.toByte() || b > '9'.toByte()) b = readByte()
        while ('0'.toByte() <= b && b <= '9'.toByte()) {
            n *= 10
            n += b - '0'.toByte()
            b = readByte()
        }
        return n
    }
    fun nextDouble(): Double {
        return next().toDouble()
    }
}
0