結果
問題 | No.898 tri-βutree |
ユーザー | rlangevin |
提出日時 | 2023-05-10 23:18:19 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,389 ms / 4,000 ms |
コード長 | 2,392 bytes |
コンパイル時間 | 1,147 ms |
コンパイル使用メモリ | 86,664 KB |
実行使用メモリ | 113,024 KB |
最終ジャッジ日時 | 2023-08-18 01:16:18 |
合計ジャッジ時間 | 19,469 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 470 ms
112,048 KB |
testcase_01 | AC | 73 ms
71,348 KB |
testcase_02 | AC | 85 ms
76,200 KB |
testcase_03 | AC | 85 ms
76,208 KB |
testcase_04 | AC | 85 ms
76,108 KB |
testcase_05 | AC | 85 ms
76,480 KB |
testcase_06 | AC | 87 ms
76,284 KB |
testcase_07 | AC | 985 ms
112,244 KB |
testcase_08 | AC | 982 ms
112,668 KB |
testcase_09 | AC | 984 ms
111,684 KB |
testcase_10 | AC | 992 ms
111,824 KB |
testcase_11 | AC | 1,389 ms
113,024 KB |
testcase_12 | AC | 993 ms
112,276 KB |
testcase_13 | AC | 969 ms
111,656 KB |
testcase_14 | AC | 975 ms
111,796 KB |
testcase_15 | AC | 966 ms
112,208 KB |
testcase_16 | AC | 969 ms
112,012 KB |
testcase_17 | AC | 999 ms
111,800 KB |
testcase_18 | AC | 991 ms
112,780 KB |
testcase_19 | AC | 985 ms
112,688 KB |
testcase_20 | AC | 989 ms
112,300 KB |
testcase_21 | AC | 1,002 ms
112,816 KB |
ソースコード
import sys input = sys.stdin.readline class LowestCommonAncestor: def __init__(self, n): self._n = n self._logn = 0 v = 1 while v <= self._n: v *= 2 self._logn += 1 self._depth = [0] * self._n self._distance = [0] * self._n self._ancestor = [[-1] * self._n for _ in range(self._logn)] self._G = [[] for i in range(self._n)] def add_edge(self, u, v, w=1): self._G[u].append((v, w)) self._G[v].append((u, w)) def build(self, root=0): stack = [root] while stack: cur = stack.pop() for nex, w in self._G[cur]: if self._ancestor[0][nex] != cur and self._ancestor[0][cur] != nex: self._ancestor[0][nex] = cur self._depth[nex] = self._depth[cur] + 1 self._distance[nex] = self._distance[cur] + w stack.append(nex) for k in range(1, self._logn): for i in range(self._n): if self._ancestor[k - 1][i] == -1: self._ancestor[k][i] = -1 else: self._ancestor[k][i] = self._ancestor[k - 1][self._ancestor[k - 1][i]] def lca(self, u, v): if self._depth[u] > self._depth[v]: u, v = v, u for k in range(self._logn - 1, -1, -1): if ((self._depth[v] - self._depth[u]) >> k) & 1: v = self._ancestor[k][v] if u == v: return u for k in range(self._logn - 1, -1, -1): if self._ancestor[k][u] != self._ancestor[k][v]: u = self._ancestor[k][u] v = self._ancestor[k][v] return self._ancestor[0][u] def distance(self, u, v): return self._distance[u] + self._distance[v] - 2 * self._distance[self.lca(u, v)] N = int(input()) T = LowestCommonAncestor(N) for i in range(N - 1): u, v, w = map(int, input().split()) T.add_edge(u, v, w) T.build() Q = int(input()) for _ in range(Q): L = list(map(int, input().split())) ans = 10 ** 18 for i in range(3): ans = min(ans, T.distance(L[i], L[(i + 1)%3]) + T.distance(T.lca(L[i], L[(i + 1)%3]), L[(i + 2)%3])) print(ans)