結果
問題 | No.386 貪欲な領主 |
ユーザー |
![]() |
提出日時 | 2023-10-03 00:01:29 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 660 ms / 2,000 ms |
コード長 | 2,353 bytes |
コンパイル時間 | 193 ms |
コンパイル使用メモリ | 82,108 KB |
実行使用メモリ | 116,184 KB |
最終ジャッジ日時 | 2024-07-26 13:57:03 |
合計ジャッジ時間 | 5,752 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 16 |
ソースコード
import sysinput = sys.stdin.readlineclass LowestCommonAncestor:def __init__(self, n):self._n = nself._logn = 0v = 1while v <= self._n:v *= 2self._logn += 1self._depth = [0] * self._nself._distance = [0] * self._nself._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]self._distance[root] = U[root]while stack:cur = stack.pop()for nex, _ in self._G[cur]:if self._ancestor[0][nex] != cur and self._ancestor[0][cur] != nex:self._ancestor[0][nex] = curself._depth[nex] = self._depth[cur] + 1self._distance[nex] = self._distance[cur] + U[nex]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] = -1else: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, ufor 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 ufor 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)] + U[self.lca(u, v)]N = int(input())G = LowestCommonAncestor(N)for i in range(N - 1):u, v = map(int, input().split())G.add_edge(u, v)G.add_edge(v, u)U = [0] * Nfor i in range(N):U[i] = int(input())G.build(0)M = int(input())ans = 0for _ in range(M):A, B, C = map(int, input().split())ans += C * G.distance(A, B)print(ans)