結果
問題 | No.1094 木登り / Climbing tree |
ユーザー | 👑 rin204 |
提出日時 | 2022-03-23 15:53:13 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,321 ms / 2,000 ms |
コード長 | 2,427 bytes |
コンパイル時間 | 393 ms |
コンパイル使用メモリ | 82,416 KB |
実行使用メモリ | 169,804 KB |
最終ジャッジ日時 | 2024-04-25 19:44:55 |
合計ジャッジ時間 | 25,979 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
53,604 KB |
testcase_01 | AC | 1,046 ms
169,136 KB |
testcase_02 | AC | 282 ms
166,228 KB |
testcase_03 | AC | 249 ms
81,848 KB |
testcase_04 | AC | 417 ms
115,600 KB |
testcase_05 | AC | 583 ms
155,492 KB |
testcase_06 | AC | 544 ms
104,840 KB |
testcase_07 | AC | 1,064 ms
168,276 KB |
testcase_08 | AC | 1,097 ms
168,052 KB |
testcase_09 | AC | 1,072 ms
168,180 KB |
testcase_10 | AC | 1,067 ms
168,088 KB |
testcase_11 | AC | 1,086 ms
168,368 KB |
testcase_12 | AC | 1,101 ms
168,532 KB |
testcase_13 | AC | 1,118 ms
168,404 KB |
testcase_14 | AC | 1,089 ms
168,356 KB |
testcase_15 | AC | 466 ms
96,216 KB |
testcase_16 | AC | 662 ms
145,880 KB |
testcase_17 | AC | 557 ms
117,016 KB |
testcase_18 | AC | 505 ms
107,360 KB |
testcase_19 | AC | 608 ms
132,984 KB |
testcase_20 | AC | 1,112 ms
168,384 KB |
testcase_21 | AC | 563 ms
119,936 KB |
testcase_22 | AC | 1,091 ms
168,160 KB |
testcase_23 | AC | 1,086 ms
169,172 KB |
testcase_24 | AC | 1,066 ms
169,652 KB |
testcase_25 | AC | 1,078 ms
169,160 KB |
testcase_26 | AC | 1,321 ms
169,804 KB |
ソースコード
import sys input = sys.stdin.readline class WeightedLCA: def __init__(self, n, edges, e, ope, root = 0): self.n = n self.e = e self.ope = ope self.logn = (n - 1).bit_length() self.root = root self.depth = [-1] * self.n self.parent = [[-1] * n for _ in range(self.logn)] self.weight = [[-1] * n for _ in range(self.logn)] self.dfs(edges) self.doubling() def dfs(self, edges): stack = [self.root] self.depth[self.root] = 0 while stack: pos = stack.pop() for npos, w in edges[pos]: if self.depth[npos] != -1: continue self.depth[npos] = self.depth[pos] + 1 self.parent[0][npos] = pos self.weight[0][npos] = w stack.append(npos) def doubling(self): for i in range(1, self.logn): for j in range(n): if self.parent[i - 1][j] != -1: p = self.parent[i - 1][j] self.parent[i][j] = self.parent[i - 1][p] self.weight[i][j] = self.ope(self.weight[i - 1][j], self.weight[i - 1][p]) def get(self, u, v): if self.depth[v] < self.depth[u]: u, v = v, u du = self.depth[u] dv = self.depth[v] ret = self.e for i in range(self.logn): if (dv - du) >> i & 1: ret = self.ope(ret, self.weight[i][v]) v = self.parent[i][v] if u == v: return ret, u for i in range(self.logn - 1, -1, -1): pu = self.parent[i][u] pv = self.parent[i][v] if pu != pv: ret = self.ope(ret, self.weight[i][u]) ret = self.ope(ret, self.weight[i][v]) u, v = pu, pv ret = self.ope(ret, self.weight[0][u]) ret = self.ope(ret, self.weight[0][v]) u = self.parent[0][u] return ret, u n = int(input()) edges = [[] for _ in range(n)] for _ in range(n - 1): a, b, c = map(int, input().split()) a -= 1 b -= 1 edges[a].append((b, c)) edges[b].append((a, c)) lca = WeightedLCA(n, edges, 0, lambda x, y: x + y) Q = int(input()) for _ in range(Q): u, v = map(int, input().split()) print(lca.get(u - 1, v - 1)[0])