結果

問題 No.1442 I-wate Shortest Path Problem
ユーザー qibqib
提出日時 2022-11-18 18:23:49
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 1,996 bytes
コンパイル時間 171 ms
コンパイル使用メモリ 81,848 KB
実行使用メモリ 148,024 KB
最終ジャッジ日時 2023-10-20 04:05:51
合計ジャッジ時間 36,152 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 48 ms
59,804 KB
testcase_01 AC 48 ms
55,456 KB
testcase_02 AC 321 ms
80,736 KB
testcase_03 AC 578 ms
80,696 KB
testcase_04 AC 318 ms
80,796 KB
testcase_05 RE -
testcase_06 AC 586 ms
80,168 KB
testcase_07 AC 280 ms
80,032 KB
testcase_08 AC 544 ms
79,616 KB
testcase_09 AC 326 ms
81,928 KB
testcase_10 AC 597 ms
80,880 KB
testcase_11 AC 592 ms
80,932 KB
testcase_12 AC 1,828 ms
137,032 KB
testcase_13 RE -
testcase_14 AC 1,405 ms
123,684 KB
testcase_15 AC 1,198 ms
116,128 KB
testcase_16 AC 1,664 ms
124,952 KB
testcase_17 AC 2,783 ms
144,016 KB
testcase_18 AC 2,738 ms
147,092 KB
testcase_19 AC 2,112 ms
137,112 KB
testcase_20 AC 2,701 ms
143,684 KB
testcase_21 AC 2,797 ms
147,348 KB
testcase_22 RE -
testcase_23 AC 2,097 ms
137,408 KB
testcase_24 RE -
testcase_25 AC 1,990 ms
148,024 KB
testcase_26 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import deque
import heapq

INF = 1 << 60

n, k = map(int, input().split())
g = [[] for _ in range(n + k)]
for _ in range(n - 1):
  a, b, c = map(int, input().split())
  a -= 1
  b -= 1
  g[a].append((b, c))
  g[b].append((a, c))

src = 0
depth = [INF for _ in range(n)]
depth[src] = 0
dq = deque()
dq.appendleft(src)
m = n.bit_length()
doub = [[INF for _ in range(n)] for _ in range(m)]
doub[0][src] = src
train = [INF for _ in range(n)]
train[src] = 0
while len(dq) > 0:
  cur = dq.pop()
  for nxt, c in g[cur]:
    if depth[nxt] < INF:
      continue
    depth[nxt] = depth[cur] + 1
    train[nxt] = train[cur] + c
    doub[0][nxt] = cur
    dq.appendleft(nxt)

for i in range(1, m):
  for v in range(n):
    doub[i][v] = doub[i - 1][doub[i - 1][v]]

def lca(u, v):
  ut = u
  vt = v

  if depth[ut] > depth[vt]:
    ut, vt = vt, ut

  diff = depth[vt] - depth[ut]
  for i in range(m):
    if (diff >> i) & 1 != 0:
      vt = doub[i][vt]

  if ut != vt:
    for i in range(depth[ut].bit_length() - 1, -1, -1):
      if doub[i][ut] != doub[i][vt]:
        ut = doub[i][ut]
        vt = doub[i][vt]

    if ut != vt:
      ut = doub[0][ut]

  return ut

air = [[INF for _ in range(n + k)] for _ in range(k)]
ps = [0 for _ in range(k)]
for i in range(k):
  _, p = map(int, input().split())
  ps[i] = p
  xs = list(map(int, input().split()))
  for x in xs:
    x -= 1
    g[n + i].append((x, 0))
    g[x].append((n + i, p))

for i in range(k):
  src = n + i
  air[i][src] = 0
  hp = [(0, src)]
  while len(hp) > 0:
    cd, cur = heapq.heappop(hp)
    if air[i][cur] > cd:
      continue
    for nxt, cost in g[cur]:
      if air[i][nxt] > air[i][cur] + cost:
        air[i][nxt] = air[i][cur] + cost
        heapq.heappush(hp, (air[i][nxt], nxt))

q = int(input())
for _ in range(q):
  u, v = map(int, input().split())
  u -= 1
  v -= 1
  ans = min([air[i][u] + air[i][v] + ps[i] for i in range(k)])
  l = lca(u, v)
  ans = min(ans, train[u] + train[v] - 2 * train[l])
  print(ans)
0