Submission #215443

---

Source Code Expand

import java.util.Scanner

/**
 * Created by hama_du on 2014/08/17.
 */
object Main extends App {
  val INF = 1000000000

  val in = new Scanner(System.in)
  val n,m = in.nextInt()
  val graph = Array.ofDim[Int](n,n)
  for {
    i <- 0 until n
    j <- 0 until n
  } {
    if (i != j) {
      graph(i)(j) = INF
    }
  }

  (0 until m).foreach(_ => {
    val a,b,d = in.nextInt()
    graph(a-1)(b-1) = d
    graph(b-1)(a-1) = d
  })

  for {
    k <- 0 until n
    i <- 0 until n
    j <- 0 until n
  } {
    graph(i)(j) = Array(graph(i)(j), graph(i)(k) + graph(k)(j)).min
  }

  println(graph.map(g => g.max).min)
}

Submission Info

Judge Result