結果

問題 No.1442 I-wate Shortest Path Problem
ユーザー first_vilfirst_vil
提出日時 2021-03-09 18:55:42
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 2,583 ms / 3,000 ms
コード長 3,597 bytes
コンパイル時間 16,527 ms
コンパイル使用メモリ 453,508 KB
実行使用メモリ 151,188 KB
最終ジャッジ日時 2024-04-19 20:19:33
合計ジャッジ時間 53,861 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 262 ms
54,240 KB
testcase_01 AC 270 ms
54,444 KB
testcase_02 AC 422 ms
64,264 KB
testcase_03 AC 691 ms
95,912 KB
testcase_04 AC 433 ms
64,436 KB
testcase_05 AC 398 ms
62,308 KB
testcase_06 AC 680 ms
95,536 KB
testcase_07 AC 410 ms
64,580 KB
testcase_08 AC 681 ms
98,648 KB
testcase_09 AC 481 ms
68,740 KB
testcase_10 AC 724 ms
98,508 KB
testcase_11 AC 726 ms
105,660 KB
testcase_12 AC 1,997 ms
137,540 KB
testcase_13 AC 1,160 ms
120,464 KB
testcase_14 AC 1,687 ms
134,948 KB
testcase_15 AC 1,756 ms
139,288 KB
testcase_16 AC 2,088 ms
141,364 KB
testcase_17 AC 2,521 ms
145,128 KB
testcase_18 AC 2,583 ms
146,108 KB
testcase_19 AC 2,087 ms
147,472 KB
testcase_20 AC 2,463 ms
145,432 KB
testcase_21 AC 2,471 ms
143,336 KB
testcase_22 AC 1,239 ms
136,720 KB
testcase_23 AC 2,336 ms
151,188 KB
testcase_24 AC 1,130 ms
132,756 KB
testcase_25 AC 1,899 ms
147,152 KB
testcase_26 AC 1,371 ms
142,788 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

fun PrintWriter.solve() {
    val n = nextInt()
    val k = nextInt()
    val g = Array(n + k) { arrayListOf<Pair<Int, Int>>() }
    repeat(n - 1) {
        val a = nextInt() - 1
        val b = nextInt() - 1
        val c = nextInt()
        g[a].add(Pair<Int, Int>(b, c))
        g[b].add(Pair<Int, Int>(a, c))
    }

    //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 (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 p = Array(n) { 0 }
    for (i in 0 until k) {
        val m = nextInt()
        p[i] = nextInt()
        repeat(m) {
            val x = nextInt() - 1
            g[n + i].add(Pair<Int, Int>(x, 0))
            g[x].add(Pair<Int, Int>(n + i, p[i]))
        }
    }

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

    //Dijkstra-begin
    val dp = Array(n + k) { 0L }
    val pq = PriorityQueue<Long>()
    for (i in 0 until k) {
        val yet = Array(n + k) { true }
        dp[n + i] = 0
        yet[n + i] = false
        pq.add((n + i).toLong())
        while (pq.isNotEmpty()) {
            var d = pq.remove()
            val cur = (d % (n + k)).toInt()
            d /= n + k
            if (dp[cur] < d) continue
            for ((to, cost) in g[cur]) {
                if (yet[to]) {
                    yet[to] = false
                    dp[to] = d + cost
                    pq.add((d + cost) * (n + k) + to)
                } else if (dp[to] > d + cost) {
                    dp[to] = d + cost
                    pq.add((d + cost) * (n + k) + 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()
}

// 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