結果

問題 No.898 tri-βutree
コンテスト
ユーザー ntuda
提出日時 2024-12-12 19:31:07
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 4,469 bytes
コンパイル時間 525 ms
コンパイル使用メモリ 82,384 KB
実行使用メモリ 131,148 KB
最終ジャッジ日時 2024-12-12 19:31:31
合計ジャッジ時間 24,120 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 20 RE * 1
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing

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

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())
UVW = [list(map(int,input().split())) for _ in range(N-1)]
E = [[] for _ in range(N)]
for u, v, w in UVW:
    E[u].append((v,w))
    E[v].append((u,w))

def dfs(x):
    for y, w in E[x]:
        if D[y] == -1:
            D[y] = D[x] + 1
            AC[y] = AC[x] + w
            if FA[y] == -1:
                FA[y] = len(ET)
            ET.append(y)
            base.append((D[y], y))
            dfs(y)
            ET.append(x)
            base.append((D[x], x))

FA = [-1] * N
D = [-1] * N
AC = [-1] * N
base = [(0,0)]
ET = [0]
D[0] = 0
FA[0] = 0
AC[0] = 0
dfs(0)

def calc(x, y):
    fax = FA[x]
    fay = FA[y]
    if fax > fay:
        fax, fay = fay, fax
    lca = ST.prod(fax, fay + 1)[1]
    return AC[x] + AC[y] - 2 * AC[lca]

ST = SegTree(min, (2 * N,0), base)
for _ in range(int(input())):
    XYZ = list(map(int,input().split()))
    ans = 0
    for i in range(3):
        ans += calc(XYZ[i], XYZ[(i + 1) % 3])
    print(ans // 2)
0