結果
問題 | No.1833 Subway Planning |
ユーザー | yudedako |
提出日時 | 2022-02-22 12:11:29 |
言語 | Scala(Beta) (3.4.0) |
結果 |
AC
|
実行時間 | 3,190 ms / 4,000 ms |
コード長 | 1,972 bytes |
コンパイル時間 | 11,962 ms |
コンパイル使用メモリ | 260,148 KB |
実行使用メモリ | 147,940 KB |
最終ジャッジ日時 | 2023-09-13 02:41:40 |
合計ジャッジ時間 | 71,319 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,020 ms
62,828 KB |
testcase_01 | AC | 1,016 ms
63,064 KB |
testcase_02 | AC | 1,018 ms
62,936 KB |
testcase_03 | AC | 980 ms
63,176 KB |
testcase_04 | AC | 1,971 ms
138,868 KB |
testcase_05 | AC | 1,920 ms
136,952 KB |
testcase_06 | AC | 2,624 ms
139,504 KB |
testcase_07 | AC | 2,868 ms
139,184 KB |
testcase_08 | AC | 2,992 ms
139,364 KB |
testcase_09 | AC | 2,153 ms
136,912 KB |
testcase_10 | AC | 2,989 ms
147,940 KB |
testcase_11 | AC | 2,669 ms
140,964 KB |
testcase_12 | AC | 2,296 ms
139,724 KB |
testcase_13 | AC | 3,190 ms
143,004 KB |
testcase_14 | AC | 2,697 ms
138,024 KB |
testcase_15 | AC | 2,115 ms
138,660 KB |
testcase_16 | AC | 2,741 ms
139,284 KB |
testcase_17 | AC | 2,900 ms
139,104 KB |
testcase_18 | AC | 2,809 ms
138,008 KB |
testcase_19 | AC | 2,173 ms
138,396 KB |
testcase_20 | AC | 1,990 ms
127,076 KB |
testcase_21 | AC | 2,964 ms
138,996 KB |
testcase_22 | AC | 2,872 ms
139,820 KB |
testcase_23 | AC | 1,037 ms
63,040 KB |
testcase_24 | AC | 1,024 ms
63,000 KB |
testcase_25 | AC | 1,005 ms
63,136 KB |
ソースコード
import scala.collection.mutable.* import scala.io.StdIn.* import scala.util.chaining.* import scala.math.* import scala.reflect.ClassTag import scala.util.* import scala.annotation.tailrec import scala.collection.mutable @main def main = val n = readLine.toInt val edges = Array.fill(n - 1){ val Array(a, b, c) = readLine.split(' ').map(_.toInt) (a - 1, b - 1, c) } val graph = Array.fill(n){ArrayBuffer[(Int, Int)]()} for (a, b, c) <- edges do graph(a).addOne((b, c)) graph(b).addOne((a, c)) val sortedEdge = edges.sortBy(-_._3) val root = sortedEdge.head._1 val depth = Array.fill(n){-1}.tap(_(root) = 0) val parent = Array.fill(n){-1} val cost = Array.fill(n){-1} val stack = mutable.Stack[Int](root) while stack.nonEmpty do val top = stack.pop() for (next, c) <- graph(top) do if depth(next) == -1 then depth(next) = depth(top) + 1 parent(next) = top cost(next) = c stack.push(next) val degree = Array.fill(n){0} var canReduceAll = true var currentMin = Int.MaxValue val onPath = Array.fill(n){false}.tap(_(root) = true) var result = sortedEdge(0)._3 for i <- sortedEdge.indices do if canReduceAll then val (a, b, _) = sortedEdge(i) val nextCost = if sortedEdge.indices.contains(i + 1) then sortedEdge(i + 1)._3 else 0 val start = if depth(a) < depth(b) then b else a if !onPath(start) then var current = start while !onPath(current) do currentMin = min(currentMin, cost(current)) onPath(current) = true current = parent(current) degree(current) += 1 if (current != root && degree(current) > 1) || (current == root && degree(current) > 2) then canReduceAll = false else result = min(result, max(nextCost, sortedEdge.head._3 - currentMin)) else result = min(result, max(nextCost, sortedEdge.head._3 - currentMin)) println(result)