TestCase/LibraryChecker/vertex_add_subtree_sum.test.py

• View this file on GitHub
• Last update: 2021-01-16 03:42:28+09:00
• Problem: https://judge.yosupo.jp/problem/vertex_add_subtree_sum

Depends on

• 一点加算・区間和取得 (DataStructure/BinaryIndexedTree/PointAddRangeSum.py)
• HL分解 (Heavy-Light Decomposition) (Graph/Tree/HLDecomposition.py)

Code

# verification-helper: PROBLEM https://judge.yosupo.jp/problem/vertex_add_subtree_sum
import sys
input = sys.stdin.buffer.readline

from DataStructure.BinaryIndexedTree.PointAddRangeSum import BinaryIndexedTree
from Graph.Tree.HLDecomposition import HLDecomposition


def main():
    n, q = map(int, input().split())
    a = list(map(int, input().split()))
    p = list(map(int, input().split()))
    queries = [list(map(int, input().split())) for i in range(q)]

    tree = [[] for i in range(n)]
    for u, v in enumerate(p):
        u += 1
        tree[u].append(v)
        tree[v].append(u)

    hld = HLDecomposition(tree)
    bit = BinaryIndexedTree(n)

    for i, val in enumerate(a):
        bit.add(hld[i], val)

    ans = []
    for flag, *query in queries:
        if flag == 0:
            u, val = query
            bit.add(hld[u], val)
        else:
            u = query[0]
            l, r = hld.range_subtree(u)
            ans.append(bit.sum(l, r))

    print("\n".join(map(str, ans)))


if __name__ == '__main__':
    main()

Traceback (most recent call last):
  File "/opt/hostedtoolcache/Python/3.12.4/x64/lib/python3.12/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
    bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/opt/hostedtoolcache/Python/3.12.4/x64/lib/python3.12/site-packages/onlinejudge_verify/languages/python.py", line 96, in bundle
    raise NotImplementedError
NotImplementedError

Back to top page