結果

問題 No.1308 ジャンプビーコン
ユーザー semisagi
提出日時 2020-12-05 01:31:54
言語 Swift
(6.0.3)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,374 bytes
コンパイル時間 3,729 ms
コンパイル使用メモリ 133,112 KB
実行使用メモリ 159,360 KB
最終ジャッジ日時 2024-09-15 09:49:37
合計ジャッジ時間 64,801 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 25 TLE * 11 -- * 1
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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
var prefix = [[Int]]()
var suffix = [[Int]]()
for i in 0 ..< N {
    prefix.append([Int](repeating: inf, count: tree[i].count + 1))
    suffix.append([Int](repeating: inf, count: tree[i].count + 1))
}
for i in 0 ..< Q - 1 {
    var dp2 = [Int](repeating: inf, count: N)
    func dfs(_ u: Int, _ parent: Int?) {
        dp2[u] = dp[i, u]
        for (v, w) in tree[u] where v != parent {
            dfs(v, u)
            dp2[u] = min(dp2[u], dp2[v] + w)
        }
    }
    func dfs2(_ u: Int, _ parent: Int?) {
        prefix[u][0] = dp[i, u]
        for (i, (v, w)) in tree[u].enumerated() {
            prefix[u][i + 1] = min(prefix[u][i], dp2[v] + w)
        }
        suffix[u][tree[u].count] = dp[i, u]
        for (i, (v, w)) in tree[u].enumerated().reversed() {
            suffix[u][i] = min(suffix[u][i + 1], dp2[v] + w)
        }
        dp[i + 1, u] = min(dp[i + 1, u], suffix[u][0] + C + distance[u, X[i + 1]])
        for i in tree[u].indices {
            let v = tree[u][i].0
            guard v != parent else { continue }
            dp2[u] = min(prefix[u][i], suffix[u][i + 1])
            dfs2(v, u)
        }
    }
    dfs(0, nil)
    dfs2(0, nil)
    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]])
    }
}
print((0 ..< N).map { dp[Q - 1, $0] }.min()!)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0