結果
問題 | No.1308 ジャンプビーコン |
ユーザー | tamato |
提出日時 | 2020-12-05 01:11:19 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,200 ms / 4,000 ms |
コード長 | 1,534 bytes |
コンパイル時間 | 290 ms |
コンパイル使用メモリ | 87,416 KB |
実行使用メモリ | 196,748 KB |
最終ジャッジ日時 | 2023-10-13 12:48:57 |
合計ジャッジ時間 | 38,713 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 95 ms
72,080 KB |
testcase_01 | AC | 96 ms
71,724 KB |
testcase_02 | AC | 94 ms
72,024 KB |
testcase_03 | AC | 101 ms
77,104 KB |
testcase_04 | AC | 102 ms
77,256 KB |
testcase_05 | AC | 103 ms
76,936 KB |
testcase_06 | AC | 107 ms
76,756 KB |
testcase_07 | AC | 101 ms
76,936 KB |
testcase_08 | AC | 137 ms
78,508 KB |
testcase_09 | AC | 142 ms
78,488 KB |
testcase_10 | AC | 134 ms
78,304 KB |
testcase_11 | AC | 139 ms
78,540 KB |
testcase_12 | AC | 133 ms
78,352 KB |
testcase_13 | AC | 223 ms
78,912 KB |
testcase_14 | AC | 214 ms
78,944 KB |
testcase_15 | AC | 229 ms
78,984 KB |
testcase_16 | AC | 228 ms
78,864 KB |
testcase_17 | AC | 220 ms
79,160 KB |
testcase_18 | AC | 2,200 ms
176,948 KB |
testcase_19 | AC | 2,060 ms
171,348 KB |
testcase_20 | AC | 2,013 ms
149,032 KB |
testcase_21 | AC | 2,047 ms
175,968 KB |
testcase_22 | AC | 2,117 ms
162,344 KB |
testcase_23 | AC | 92 ms
71,732 KB |
testcase_24 | AC | 135 ms
78,788 KB |
testcase_25 | AC | 137 ms
79,128 KB |
testcase_26 | AC | 1,493 ms
132,096 KB |
testcase_27 | AC | 1,463 ms
133,768 KB |
testcase_28 | AC | 1,503 ms
123,004 KB |
testcase_29 | AC | 1,829 ms
182,024 KB |
testcase_30 | AC | 1,852 ms
190,040 KB |
testcase_31 | AC | 1,612 ms
135,708 KB |
testcase_32 | AC | 1,576 ms
196,748 KB |
testcase_33 | AC | 1,925 ms
147,196 KB |
testcase_34 | AC | 1,541 ms
131,744 KB |
testcase_35 | AC | 1,578 ms
154,364 KB |
testcase_36 | AC | 1,672 ms
132,740 KB |
testcase_37 | AC | 1,331 ms
123,056 KB |
testcase_38 | AC | 1,943 ms
148,488 KB |
testcase_39 | AC | 2,036 ms
138,332 KB |
ソースコード
mod = 1000000007 eps = 10**-9 inf = 10**18 def main(): import sys from collections import deque input = sys.stdin.buffer.readline N, Q, C = map(int, input().split()) adj = [[] for _ in range(N+1)] for _ in range(N-1): a, b, c = map(int, input().split()) adj[a].append((b, c)) adj[b].append((a, c)) X = list(map(int, input().split())) dp = [inf] * (N+1) dp[X[0]] = 0 for i in range(Q-1): u0 = X[i] v0 = X[i+1] que = deque() que.append(v0) seen = [-1] * (N+1) seen[v0] = 0 par = [0] * (N+1) child = [[] for _ in range(N+1)] seq = [] while que: v = que.popleft() seq.append(v) for u, c in adj[v]: if seen[u] == -1: seen[u] = seen[v] + c par[u] = v child[v].append(u) que.append(u) seq.reverse() dp_new = [inf] * (N+1) dp_tree = [inf] * (N+1) for j in range(1, N+1): if dp[j] == inf: continue dp_new[j] = dp[j] + seen[u0] dp_tree[u0] = min(dp_tree[u0], dp[j] + seen[u0]) dp_tree[j] = min(dp_tree[j], dp[j] + C + seen[j]) for v in seq: for u in child[v]: dp_tree[v] = min(dp_tree[v], dp_tree[u]) dp_new[v] = min(dp_new[v], dp_tree[v]) dp = dp_new print(min(dp)) if __name__ == '__main__': main()