結果

問題 No.1641 Tree Xor Query
ユーザー sgsw
提出日時 2021-08-14 23:38:08
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 350 ms / 5,000 ms
コード長 6,819 bytes
コンパイル時間 274 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 122,584 KB
最終ジャッジ日時 2024-10-06 02:37:02
合計ジャッジ時間 4,257 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import types
_atcoder_code = """
# Python port of AtCoder Library.
__all__ = ["string","lazysegtree","convolution","maxflow","modint"
    ,"mincostflow","segtree","_scc","_math","math","dsu","twosat","fenwicktree","scc","_bit","lca","unverified","graph","matrix","algebra"
        ,"combinatorics"]
__version__ = '0.0.1'
"""
atcoder = types.ModuleType('atcoder')
exec(_atcoder_code, atcoder.__dict__)
_atcoder__bit_code = """
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
"""
atcoder._bit = types.ModuleType('atcoder._bit')
exec(_atcoder__bit_code, atcoder._bit.__dict__)
_atcoder_segtree_code = """
import typing
# import atcoder._bit
class SegTree:
 
    '''
    Segment Tree Library.
    op(S,S) -> S
    e = Identity element
    
    SegTree(op,e,n) := Initialized by [e]*(n)
    SegTree(op,e,vector) := Initialized by vector
    '''
    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 = atcoder._bit._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:
        '''
        a[p] -> x in O(logN).
        '''
        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 increment(self, p: int, x : typing.Any) -> None:
        '''
        a[p] -> a[p] + x in O(logN).
        '''
        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:
        '''
        return a[p] in O(1).
        '''
        assert 0 <= p < self._n
        return self._d[p + self._size]
    def prod(self, left: int, right: int) -> typing.Any:
        '''
        return op(a[l...r)) in O(logN).
        '''
        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:
        '''
        let f(S) -> bool and l is const.
        return maximum r for which f(op[l...r)) == true is satisfied, in O(logN).
        '''
        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:
        '''
        let f(S) -> bool and r is const.
        return minimum l for which f(op[l...r)) == true is satisfied, in O(logN).
        '''
        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])
"""
atcoder.segtree = types.ModuleType('atcoder.segtree')
atcoder.segtree.__dict__['atcoder'] = atcoder
atcoder.segtree.__dict__['atcoder._bit'] = atcoder._bit
exec(_atcoder_segtree_code, atcoder.segtree.__dict__)
SegTree = atcoder.segtree.SegTree
'''
    Python3(PyPy3) Template for Programming-Contest.
    author : sgsw
    generated : 2021/08/14   
    when : 23:20:07
'''
import sys
def input():
    return sys.stdin.readline().rstrip()
DXY = [(0, -1), (1, 0), (0, 1), (-1, 0)]  # LDRU
mod = 998244353
inf = 1 << 64
def euler_tour(Graph, S):
    q = [~S, S]
    inc = 0
    n = len(Graph)
    IN, OUT = [-1]*(n), [-1]*(n)
    while q:
        p = q.pop()
        if p >= 0:
            IN[p] = inc
            for adj in Graph[p]:
                if IN[adj] >= 0:
                    continue
                q.append(~adj)
                q.append(adj)
        else:
            OUT[~p] = inc
        inc += 1
    return IN, OUT
# from atcoder.segtree import SegTree
def main():
    n,q = map(int,input().split())
    C = list(map(int,input().split()))
    g = [[] for i in range(n)]
    for i in range(n - 1):
        u,v = map(int,input().split())
        u -= 1
        v -= 1
        g[u].append(v)
        g[v].append(u)
    Query = [tuple(map(int,input().split())) for i in range(q)]
    IN,OUT = euler_tour(g,S = 0)
    A = [0]*(2 * n)
    for i,v in enumerate(IN):
        A[v] = C[i]
    seg = SegTree(lambda x,y : x ^ y,0,A)
    for t,x,y in Query:
        if t == 1:
            x -= 1
            l,r = IN[x],OUT[x]
            val = seg.get(l)
            seg.set(l,val ^ y)
        else:
            x -= 1
            l,r = IN[x],OUT[x]
            ans = seg.prod(l,r)  
            print(ans)
    return 0
if __name__ == "__main__":
    main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0