結果

問題 No.1641 Tree Xor Query
ユーザー kyaneko999kyaneko999
提出日時 2021-08-06 22:25:45
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 632 ms / 5,000 ms
コード長 5,786 bytes
コンパイル時間 138 ms
コンパイル使用メモリ 82,764 KB
実行使用メモリ 199,584 KB
最終ジャッジ日時 2024-09-17 02:29:55
合計ジャッジ時間 4,077 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
66,912 KB
testcase_01 AC 50 ms
66,676 KB
testcase_02 AC 51 ms
65,796 KB
testcase_03 AC 51 ms
66,672 KB
testcase_04 AC 52 ms
67,260 KB
testcase_05 AC 52 ms
67,488 KB
testcase_06 AC 52 ms
67,160 KB
testcase_07 AC 52 ms
67,748 KB
testcase_08 AC 56 ms
66,820 KB
testcase_09 AC 57 ms
66,100 KB
testcase_10 AC 54 ms
67,272 KB
testcase_11 AC 49 ms
66,480 KB
testcase_12 AC 50 ms
67,344 KB
testcase_13 AC 620 ms
199,388 KB
testcase_14 AC 632 ms
199,584 KB
testcase_15 AC 111 ms
79,728 KB
testcase_16 AC 186 ms
83,184 KB
testcase_17 AC 182 ms
81,528 KB
testcase_18 AC 122 ms
80,848 KB
testcase_19 AC 147 ms
79,864 KB
testcase_20 AC 308 ms
111,192 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from sys import exit, stdin, setrecursionlimit
from collections import deque, defaultdict, Counter
from copy import deepcopy
from bisect import bisect_left, bisect_right, insort_left, insort_right
from heapq import heapify, heappop, heappush
from itertools import product, permutations, combinations, combinations_with_replacement
from functools import reduce
from math import gcd, sin, cos, tan, asin, acos, atan, atan2, degrees, radians, ceil, floor, sqrt, factorial
from math import pi as PI
from random import randint as rd

setrecursionlimit(500000)
INF = (1<<61)-1
EPS = 1e-10
MOD = 10**9+7
# MOD = 998244353

def input():
    return stdin.readline().strip('\n')
def intput():
    return int(input())
def minput():
    return input().split()
def linput():
    return input().split()
def mint():
    return map(int,input().split())
def lint():
    return list(map(int,input().split()))
def ilint():
    return intput(),lint()
def lcm(x,y):
    return x*y//gcd(x,y)
def lgcd(l):
    return reduce(gcd,l)
def llcm(l):
    return reduce(lcm,l)
def powmod(n,i,mod=MOD):
    return pow(n,mod-1+i,mod) if i<0 else pow(n,i,mod)
def div2(x):
    return x.bit_length()
def div10(x):
    return len(str(x))-(x==0)
def popcount(x):
    return bin(x).count('1')
def digit(x,i,max_len=None):
    s = str(x)
    if max_len:
        i -= max_len-len(s)
    return int(s[i-1]) if i>0 else 0
def digitsum(x):
    ans = 0
    for i in range(div10(x)):
        ans += digit(x,i+1)
    return ans
def pf(x,mode='counter'):
    C = Counter()
    p = 2
    while x>1:
        k = 0
        while x%p==0:
            x //= p
            k += 1
        if k>0:
            C[p] += k
        p = p+2-(p==2) if p*p<x else x
    if mode=='counter':
        return C
    S = set([1])
    for k in C:
        T = set()
        for x in S:
            for i in range(C[k]+1):
                T.add(x*(k**i))
        S = T
    if mode=='set':
        return S
    if mode=='list':
        return sorted(S)
def isprime(x):
    if x<2:
        return False
    return len(pf(x,'set'))==2
def matmul(A, B):
    # import numpy
    A1, A2 = A >> 15, A & (1 << 15) - 1
    B1, B2 = B >> 15, B & (1 << 15) - 1
    X = np.dot(A1, B1) % MOD
    Y = np.dot(A2, B2)
    Z = np.dot(A1 + A2, B1 + B2) - X - Y
    return ((X << 30) + (Z << 15) + Y) % MOD
def matpow(A, N):
    P = np.eye(A.shape[0], dtype=np.int64)
    while N:
        if N & 1:
            P = matmul(P, A)
        A = matmul(A, A)
        N >>= 1
    return P
def zash(S):
    lis = sorted(S)
    dic = {}
    for i,x in enumerate(lis):
        dic[x] = i
    return lis, dic
def pr(*x):
    print(*x, sep='', end='') if len(x) else print()
def lprint(l):
    for x in l: print(x)
def ston(c, c0='a'):
    return ord(c)-ord(c0)
def ntos(x, c0='a'):
    return chr(x+ord(c0))
def judge(x, l=['Yes', 'No']):
    print(l[0] if x else l[1])
def debug(*x, flag=1):
    if flag: print(*x)

######################################################

def segfunc(x,y):
    return x^y
class LazySegTree_RAQ:
    def __init__(self,init_val,segfunc,ide_ele):
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1<<(n-1).bit_length()
        self.tree = [ide_ele]*2*self.num
        self.lazy = [0]*2*self.num
        for i in range(n):
            self.tree[self.num+i] = init_val[i]
        for i in range(self.num-1,0,-1):
            self.tree[i] = self.segfunc(self.tree[2*i], self.tree[2*i+1])
    def gindex(self,l,r):
        l += self.num
        r += self.num
        lm = l>>(l&-l).bit_length()
        rm = r>>(r&-r).bit_length()
        while r>l:
            if l<=lm:
                yield l
            if r<=rm:
                yield r
            r >>= 1
            l >>= 1
        while l:
            yield l
            l >>= 1
    def propagates(self,*ids):
        for i in reversed(ids):
            v = self.lazy[i]
            if v==0:
                continue
            self.lazy[i] = 0
            self.lazy[2*i] ^= v
            self.lazy[2*i+1] ^= v
            self.tree[2*i] ^= v
            self.tree[2*i+1] ^= v
    def add(self,l,r,x):
        ids = self.gindex(l,r)
        l += self.num
        r += self.num
        while l<r:
            if l&1:
                self.lazy[l] ^= x
                self.tree[l] ^= x
                l += 1
            if r&1:
                self.lazy[r-1] ^= x
                self.tree[r-1] ^= x
            r >>= 1
            l >>= 1
        for i in ids:
            self.tree[i] = self.segfunc(self.tree[2*i], self.tree[2*i+1]) + self.lazy[i]
    def query(self,l,r):
        self.propagates(*self.gindex(l,r))
        res = self.ide_ele
        l += self.num
        r += self.num
        while l<r:
            if l&1:
                res = self.segfunc(res,self.tree[l])
                l += 1
            if r&1:
                res = self.segfunc(res,self.tree[r-1])
            l >>= 1
            r >>= 1
        return res

N,Q=mint()
C=lint()
node=[[] for _ in range(N+1)]
for _ in range(N-1):
    a,b=mint()
    node[a].append(b)
    node[b].append(a)
tour=[]
in_=[-1]*(N+1)
out_=[-1]*(N+1)
done=[0]*(N+1)

def dfs(x):
    in_[x]=len(tour)
    out_[x]=len(tour)
    tour.append(x)
    done[x]=1
    for y in node[x]:
        if not done[y]:
            dfs(y)
            out_[x]=len(tour)
            tour.append(x)
dfs(1)
init=[0]*len(tour)
for x in range(1,N+1):
    init[in_[x]]=C[x-1]
# debug(tour)
# debug(in_)
# debug(out_)
# debug(init)
T=LazySegTree_RAQ(init,segfunc,0)
for _ in range(Q):
#     debug(T.query(in_[1],in_[1]+1))
#     debug(T.query(in_[2],in_[2]+1))
#     debug(T.query(in_[3],in_[3]+1))
    t,x,y=mint()
    if t==1:
        T.add(in_[x],in_[x]+1,y)
    else:
        print(T.query(in_[x],out_[x]+1))
0