結果
問題 | No.386 貪欲な領主 |
ユーザー |
![]() |
提出日時 | 2024-07-27 15:46:22 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 787 ms / 2,000 ms |
コード長 | 4,339 bytes |
コンパイル時間 | 566 ms |
コンパイル使用メモリ | 82,532 KB |
実行使用メモリ | 220,896 KB |
最終ジャッジ日時 | 2024-07-27 15:46:31 |
合計ジャッジ時間 | 7,187 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 16 |
ソースコード
import sys sys.setrecursionlimit(100050) def _ceil_pow2(n: int) -> int: x = 0 while (1 << x) < n: x += 1 return x def _bsf(n: int) -> int: x = 0 while n % 2 == 0: x += 1 n //= 2 return x import typing class SegTree: def __init__(self, op: typing.Callable[[typing.Any, typing.Any], typing.Any], e: typing.Any, v: typing.Union[int, typing.List[typing.Any]]) -> None: self._op = op self._e = e if isinstance(v, int): v = [e] * v self._n = len(v) self._log = _ceil_pow2(self._n) self._size = 1 << self._log self._d = [e] * (2 * self._size) for i in range(self._n): self._d[self._size + i] = v[i] for i in range(self._size - 1, 0, -1): self._update(i) def set(self, p: int, x: typing.Any) -> None: assert 0 <= p < self._n p += self._size self._d[p] = x for i in range(1, self._log + 1): self._update(p >> i) def get(self, p: int) -> typing.Any: assert 0 <= p < self._n return self._d[p + self._size] def prod(self, left: int, right: int) -> typing.Any: assert 0 <= left <= right <= self._n sml = self._e smr = self._e left += self._size right += self._size while left < right: if left & 1: sml = self._op(sml, self._d[left]) left += 1 if right & 1: right -= 1 smr = self._op(self._d[right], smr) left >>= 1 right >>= 1 return self._op(sml, smr) def all_prod(self) -> typing.Any: return self._d[1] def max_right(self, left: int, f: typing.Callable[[typing.Any], bool]) -> int: assert 0 <= left <= self._n assert f(self._e) if left == self._n: return self._n left += self._size sm = self._e first = True while first or (left & -left) != left: first = False while left % 2 == 0: left >>= 1 if not f(self._op(sm, self._d[left])): while left < self._size: left *= 2 if f(self._op(sm, self._d[left])): sm = self._op(sm, self._d[left]) left += 1 return left - self._size sm = self._op(sm, self._d[left]) left += 1 return self._n def min_left(self, right: int, f: typing.Callable[[typing.Any], bool]) -> int: assert 0 <= right <= self._n assert f(self._e) if right == 0: return 0 right += self._size sm = self._e first = True while first or (right & -right) != right: first = False right -= 1 while right > 1 and right % 2: right >>= 1 if not f(self._op(self._d[right], sm)): while right < self._size: right = 2 * right + 1 if f(self._op(self._d[right], sm)): sm = self._op(self._d[right], sm) right -= 1 return right + 1 - self._size sm = self._op(self._d[right], sm) return 0 def _update(self, k: int) -> None: self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1]) N = int(input()) AB = [list(map(int, input().split())) for _ in range(N - 1)] U = [int(input()) for _ in range(N)] M = int(input()) ABC = [list(map(int, input().split())) for _ in range(M)] E = [[] for _ in range(N)] for a, b in AB: E[a].append(b) E[b].append(a) C = [-1] * N C[0] = U[0] base = [(0,0)] fa = [0] * N def dfs(x, d): for y in E[x]: if C[y] == -1: fa[y] = len(base) C[y] = C[x] + U[y] base.append((d + 1, y)) dfs(y, d + 1) base.append((d, x)) INF = N dfs(0, 0) st = SegTree(min, (INF,0), base) ans = 0 for a, b, c in ABC: faa = fa[a] fab = fa[b] if faa > fab: faa,fab = fab,faa _, lca = st.prod(faa, fab) ans += (C[a] + C[b] - 2 * C[lca] + U[lca]) * c print(ans)