結果

問題 No.848 なかよし旅行
ユーザー pekempeypekempey
提出日時 2019-07-25 06:51:34
言語 Kotlin
(1.9.23)
結果
AC  
実行時間 831 ms / 2,000 ms
コード長 2,134 bytes
コンパイル時間 13,991 ms
コンパイル使用メモリ 450,624 KB
実行使用メモリ 95,168 KB
最終ジャッジ日時 2024-04-25 14:01:35
合計ジャッジ時間 29,429 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 831 ms
95,168 KB
testcase_01 AC 291 ms
54,320 KB
testcase_02 AC 289 ms
54,396 KB
testcase_03 AC 296 ms
54,296 KB
testcase_04 AC 289 ms
54,420 KB
testcase_05 AC 303 ms
54,392 KB
testcase_06 AC 300 ms
54,372 KB
testcase_07 AC 295 ms
54,404 KB
testcase_08 AC 323 ms
54,324 KB
testcase_09 AC 340 ms
54,568 KB
testcase_10 AC 333 ms
54,412 KB
testcase_11 AC 548 ms
63,640 KB
testcase_12 AC 561 ms
65,792 KB
testcase_13 AC 603 ms
70,236 KB
testcase_14 AC 464 ms
59,236 KB
testcase_15 AC 602 ms
70,544 KB
testcase_16 AC 713 ms
77,496 KB
testcase_17 AC 630 ms
71,092 KB
testcase_18 AC 518 ms
62,620 KB
testcase_19 AC 547 ms
63,740 KB
testcase_20 AC 417 ms
57,076 KB
testcase_21 AC 638 ms
73,108 KB
testcase_22 AC 603 ms
73,628 KB
testcase_23 AC 408 ms
57,140 KB
testcase_24 AC 289 ms
54,372 KB
testcase_25 AC 781 ms
78,032 KB
testcase_26 AC 288 ms
54,312 KB
testcase_27 AC 281 ms
54,232 KB
testcase_28 AC 281 ms
54,256 KB
testcase_29 AC 283 ms
54,364 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.kt:35:10: warning: parameter 'args' is never used
fun main(args: Array<String>) {
         ^
Main.kt:42:15: warning: 'toInt(): Int' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
      if ('0'.toInt() <= c) break
              ^
Main.kt:44:19: warning: 'toLong(): Long' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
    ans = c - '0'.toLong()
                  ^
Main.kt:47:15: warning: 'toInt(): Int' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
      if ('0'.toInt() > c) break
              ^
Main.kt:48:33: warning: 'toLong(): Long' is deprecated. Conversion of Char to Number is deprecated. Use Char.code property instead.
      ans = ans * 10 + (c - '0'.toLong())
                                ^

ソースコード

diff # 

import java.util.PriorityQueue
import java.util.Scanner
import java.io.BufferedReader
import java.io.InputStreamReader

data class Edge(val v: Int, val w: Long)

val INF = 1e18.toLong()

fun dijkstra(g: Array<MutableList<Edge>>, s: Int): Array<Long> {
  data class State(val d: Long, val u: Int) : Comparable<State> {
    override operator fun compareTo(other: State): Int {
      if (d != other.d) return d.compareTo(other.d)
      return u.compareTo(other.u)
    }
  }
  var q: PriorityQueue<State> = PriorityQueue()
  val n = g.size
  var dist = Array(n, {INF})
  dist[s] = 0
  q.add(State(0, s))
  while (!q.isEmpty()) {
    val (d, u) = q.remove()
    if (d > dist[u]) continue
    for (e in g[u]) {
      if (dist[e.v] > dist[u] + e.w) {
        dist[e.v] = dist[u] + e.w
        q.add(State(dist[e.v], e.v))
      }
    }
  }
  return dist
}

fun main(args: Array<String>) {
  var br = BufferedReader(InputStreamReader(System.`in`))
  val readLong = fun(): Long {
    var ans: Long
    var c: Int
    while (true) {
      c = br.read()
      if ('0'.toInt() <= c) break
    }
    ans = c - '0'.toLong()
    while (true) {
      c = br.read()
      if ('0'.toInt() > c) break
      ans = ans * 10 + (c - '0'.toLong())
    }
    return ans
  }
  val readInt = fun(): Int = readLong().toInt()
  val start = System.currentTimeMillis()
  val N = readInt()
  val M = readInt()
  val P = readInt() - 1
  val Q = readInt() - 1
  val T = readLong()
  var g = Array(N, {mutableListOf<Edge>()})
  repeat(M) {
    val u = readInt() - 1
    val v = readInt() - 1
    val w = readLong()
    g[u].add(Edge(v, w))
    g[v].add(Edge(u, w))
  }
  val end = System.currentTimeMillis()
  System.err.println(end - start)
  val d0 = dijkstra(g, 0)
  val dp = dijkstra(g, P)
  val dq = dijkstra(g, Q)
  var ans = -INF
  if (dp[0] + dp[Q] + dq[0] <= T) {
    ans = T
  }
  for (i in 0..N-1) {
    for (j in 0..N-1) {
      if (d0[i] + d0[j] + maxOf(dp[i] + dp[j], dq[i] + dq[j]) <= T) {
        ans = maxOf(ans, T - maxOf(dp[i] + dp[j], dq[i] + dq[j]))
      }
    }
  }
  if (ans < 0L) {
    println(-1)
  } else {
    println(ans)
  }
  br.close()
}
0