結果
問題 | No.1094 木登り / Climbing tree |
ユーザー | qib |
提出日時 | 2022-12-02 21:46:13 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,600 ms / 2,000 ms |
コード長 | 1,284 bytes |
コンパイル時間 | 410 ms |
コンパイル使用メモリ | 82,468 KB |
実行使用メモリ | 167,912 KB |
最終ジャッジ日時 | 2024-04-18 05:38:21 |
合計ジャッジ時間 | 35,220 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
56,088 KB |
testcase_01 | AC | 1,488 ms
166,284 KB |
testcase_02 | AC | 401 ms
153,888 KB |
testcase_03 | AC | 288 ms
85,896 KB |
testcase_04 | AC | 458 ms
112,340 KB |
testcase_05 | AC | 817 ms
148,180 KB |
testcase_06 | AC | 632 ms
109,188 KB |
testcase_07 | AC | 1,546 ms
167,816 KB |
testcase_08 | AC | 1,517 ms
167,692 KB |
testcase_09 | AC | 1,502 ms
167,492 KB |
testcase_10 | AC | 1,569 ms
167,664 KB |
testcase_11 | AC | 1,475 ms
166,512 KB |
testcase_12 | AC | 1,580 ms
167,704 KB |
testcase_13 | AC | 1,600 ms
167,280 KB |
testcase_14 | AC | 1,551 ms
167,912 KB |
testcase_15 | AC | 584 ms
103,476 KB |
testcase_16 | AC | 1,011 ms
145,784 KB |
testcase_17 | AC | 772 ms
121,608 KB |
testcase_18 | AC | 699 ms
112,664 KB |
testcase_19 | AC | 831 ms
135,324 KB |
testcase_20 | AC | 1,394 ms
167,548 KB |
testcase_21 | AC | 719 ms
124,032 KB |
testcase_22 | AC | 1,371 ms
167,464 KB |
testcase_23 | AC | 1,447 ms
166,600 KB |
testcase_24 | AC | 1,381 ms
166,256 KB |
testcase_25 | AC | 1,391 ms
166,160 KB |
testcase_26 | AC | 1,472 ms
166,256 KB |
ソースコード
from collections import deque INF = 1 << 60 n = int(input()) g = [[] for _ in range(n)] 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)) k = n.bit_length() src = 0 doub = [[src for _ in range(k)] for _ in range(n)] depth = [INF for _ in range(n)] depth[src] = 0 cost = [0 for _ in range(n)] dq = deque() dq.appendleft(src) while len(dq) > 0: cur = dq.pop() for nxt, c in g[cur]: if depth[nxt] < INF: continue depth[nxt] = depth[cur] + 1 cost[nxt] = cost[cur] + c doub[nxt][0] = cur dq.appendleft(nxt) for i in range(1, k): for v in range(n): doub[v][i] = doub[doub[v][i - 1]][i - 1] 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(k): if (diff >> i) & 1 != 0: vt = doub[vt][i] if ut != vt: for i in range(k - 1, -1, -1): if doub[ut][i] != doub[vt][i]: ut = doub[ut][i] vt = doub[vt][i] if ut != vt: ut = doub[ut][0] return ut q = int(input()) ans = [0 for _ in range(q)] for i in range(q): s, t = map(int, input().split()) s -= 1 t -= 1 l = lca(s, t) ans[i] = cost[s] + cost[t] - 2 * cost[l] print(*ans, sep='\n')