{"componentChunkName":"component---src-templates-blog-post-js","path":"/Algorithm/BOJ-2268-Python/","result":{"data":{"site":{"siteMetadata":{"title":"hyesungoh","author":"hyesungoh","siteUrl":"https://www.hyesungoh.xyz","comment":{"disqusShortName":"","utterances":"hyesungoh/blog"},"sponsor":{"buyMeACoffeeId":""}}},"markdownRemark":{"id":"2c69a64d-8fae-5def-9aff-d1d815acdb5f","excerpt":"세그먼트 트리를 이용해 sum과 modify를 구현하는 문제. sum을 구현할 때 i가 j보다 큰 경우가 있어 WA를 많이 받았다.","html":"

세그먼트 트리를 이용해 sum과 modify를 구현하는 문제. sum을 구현할 때 i가 j보다 큰 경우가 있어 WA를 많이 받았다.

\n
import sys\nfrom math import log2, ceil\ninput = sys.stdin.readline\n\ndef query(node, start, end, left, right):\n    if start > right or left > end:\n        return 0\n    if left <= start and right >= end:\n        return tree[node]\n\n    mid = (start + end) // 2\n    return query(node*2, start, mid, left, right) + query(node*2+1, mid+1, end, left, right)\n\ndef update(node, start, end, index, to):\n    if index < start or end < index:\n        return\n    if start == end:\n        tree[node] = to\n        return\n    mid = (start + end) // 2\n    update(node*2, start, mid, index, to)\n    update(node*2+1, mid+1, end, index, to)\n    tree[node] = tree[node*2] + tree[node*2+1]\n\n\nn, m = map(int, input().split())\nheight = ceil(log2(n))\nsize = 2 ** (height + 1)\ntree = [0 for _ in range(size)]\n\nfor _ in range(m):\n    f, i, j = map(int, input().split())\n    if f:\n        update(1, 0, n - 1, i - 1, j)\n    else:\n        i, j = (i, j) if i < j else (j, i)\n        print(query(1, 0, n - 1, i - 1, j - 1))
","frontmatter":{"title":"BOJ-2268 - Python","date":"February 16, 2021"}}},"pageContext":{"slug":"/Algorithm/BOJ-2268-Python/","previous":{"fields":{"slug":"/Algorithm/BOJ-2491-Python/"},"frontmatter":{"title":"BOJ-2491 - Python","category":"Algorithm","draft":false}},"next":{"fields":{"slug":"/Algorithm/BOJ-1939-Python/"},"frontmatter":{"title":"BOJ-1939 - Python","category":"Algorithm","draft":false}}}},"staticQueryHashes":["3128451518","3290666882"]}