結果
問題 | No.1308 ジャンプビーコン |
ユーザー | semisagi |
提出日時 | 2020-12-05 02:02:36 |
言語 | Swift (5.10.0) |
結果 |
AC
|
実行時間 | 998 ms / 4,000 ms |
コード長 | 2,564 bytes |
コンパイル時間 | 1,901 ms |
コンパイル使用メモリ | 132,448 KB |
実行使用メモリ | 149,276 KB |
最終ジャッジ日時 | 2023-10-13 13:05:02 |
合計ジャッジ時間 | 20,204 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
7,808 KB |
testcase_01 | AC | 3 ms
7,736 KB |
testcase_02 | AC | 3 ms
7,816 KB |
testcase_03 | AC | 2 ms
7,812 KB |
testcase_04 | AC | 3 ms
7,856 KB |
testcase_05 | AC | 3 ms
7,904 KB |
testcase_06 | AC | 3 ms
7,964 KB |
testcase_07 | AC | 2 ms
7,792 KB |
testcase_08 | AC | 3 ms
7,948 KB |
testcase_09 | AC | 4 ms
7,948 KB |
testcase_10 | AC | 3 ms
7,936 KB |
testcase_11 | AC | 4 ms
7,924 KB |
testcase_12 | AC | 3 ms
7,836 KB |
testcase_13 | AC | 30 ms
13,016 KB |
testcase_14 | AC | 29 ms
12,984 KB |
testcase_15 | AC | 30 ms
12,972 KB |
testcase_16 | AC | 29 ms
12,968 KB |
testcase_17 | AC | 30 ms
12,920 KB |
testcase_18 | AC | 935 ms
148,908 KB |
testcase_19 | AC | 923 ms
148,768 KB |
testcase_20 | AC | 943 ms
148,876 KB |
testcase_21 | AC | 931 ms
148,892 KB |
testcase_22 | AC | 970 ms
148,880 KB |
testcase_23 | AC | 3 ms
7,792 KB |
testcase_24 | AC | 4 ms
7,972 KB |
testcase_25 | AC | 4 ms
7,964 KB |
testcase_26 | AC | 873 ms
148,876 KB |
testcase_27 | AC | 866 ms
148,908 KB |
testcase_28 | AC | 912 ms
148,824 KB |
testcase_29 | AC | 878 ms
149,172 KB |
testcase_30 | AC | 893 ms
149,164 KB |
testcase_31 | AC | 693 ms
148,992 KB |
testcase_32 | AC | 900 ms
149,272 KB |
testcase_33 | AC | 967 ms
149,276 KB |
testcase_34 | AC | 901 ms
148,968 KB |
testcase_35 | AC | 865 ms
148,908 KB |
testcase_36 | AC | 857 ms
148,932 KB |
testcase_37 | AC | 854 ms
148,944 KB |
testcase_38 | AC | 975 ms
148,976 KB |
testcase_39 | AC | 998 ms
148,952 KB |
コンパイルメッセージ
Main.swift:103:5: warning: result of call to 'dfs' is unused dfs(X[i + 1], nil) ^ ~~~~~~~~~~~~~~~
ソースコード
struct Scanner { private var elements = [String]() private var index = 0 mutating func peek() -> String { while elements.count == index { elements = readLine()!.split(separator: " ").map(String.init) index = 0 } return elements[index] } mutating func next() -> String { defer { index += 1 } return peek() } mutating func nextInt() -> Int { return Int(next())! } mutating func nextInts(_ n: Int) -> [Int] { return (0 ..< n).map { _ in nextInt() } } mutating func nextDouble() -> Double { return Double(next())! } } struct Array2D<Element> { let n1: Int let n2: Int private var elements: [Element] init(repeating: Element, _ n1: Int, _ n2: Int) { self.n1 = n1 self.n2 = n2 self.elements = [Element](repeating: repeating, count: n1 * n2) } subscript(i: Int, j: Int) -> Element { get { elements[i * n2 + j] } set { elements[i * n2 + j] = newValue } } } var scanner = Scanner() let N = scanner.nextInt() let Q = scanner.nextInt() let C = scanner.nextInt() var tree = [[(Int, Int)]](repeating: [], count: N) for _ in 0 ..< N - 1 { let u = scanner.nextInt() - 1 let v = scanner.nextInt() - 1 let l = scanner.nextInt() tree[u].append((v, l)) tree[v].append((u, l)) } var distance = Array2D<Int>(repeating: 0, N, N) func dfs(u: Int, parent: Int?, root: Int) { for (v, w) in tree[u] where v != parent { distance[root, v] = distance[root, u] + w dfs(u: v, parent: u, root: root) } } for i in 0 ..< N { dfs(u: i, parent: nil, root: i) } let X = scanner.nextInts(Q).map { $0 - 1 } let inf = Int.max / 2 var dp = Array2D<Int>(repeating: inf, Q, N) dp[0, X[0]] = 0 for i in 0 ..< Q - 1 { for j in 0 ..< N where dp[i, j] != inf { dp[i + 1, j] = min(dp[i + 1, j], dp[i, j] + distance[X[i], X[i + 1]]) } let m = (0 ..< N).map { dp[i, $0] }.min()! for j in 0 ..< N { dp[i + 1, j] = min(dp[i + 1, j], m + distance[X[i], j] + distance[j, X[i + 1]]) } func dfs(_ u: Int, _ parent: Int?) -> Int { var result = dp[i, u] + distance[u, X[i + 1]] + C for (v, _) in tree[u] where v != parent { let value = dfs(v, u) result = min(result, value) } dp[i + 1, u] = min(dp[i + 1, u], result) return result } dfs(X[i + 1], nil) } print((0 ..< N).map { dp[Q - 1, $0] }.min()!)