結果

問題 No.1641 Tree Xor Query
ユーザー ygd.
提出日時 2021-08-07 00:04:16
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 532 ms / 5,000 ms
コード長 3,277 bytes
コンパイル時間 154 ms
コンパイル使用メモリ 82,848 KB
実行使用メモリ 123,768 KB
最終ジャッジ日時 2024-09-17 04:23:54
合計ジャッジ時間 3,909 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

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

def segfunc(x,y):
return x^y
class SegmentTree(object):
def __init__(self, A, dot, unit):
n = 1 << (len(A) - 1).bit_length()
tree = [unit] * (2 * n)
for i, v in enumerate(A):
tree[i + n] = v
for i in range(n - 1, 0, -1):
tree[i] = dot(tree[i << 1], tree[i << 1 | 1])
self._n = n
self._tree = tree
self._dot = dot
self._unit = unit
def __getitem__(self, i):
return self._tree[i + self._n]
def update(self, i, v):
i += self._n
self._tree[i] = v
while i != 1:
i >>= 1
self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])
def add(self, i, v):
self.update(i, self[i] + v)
def sum(self, l, r): #[l,r)
l += self._n
r += self._n
l_val = r_val = self._unit
while l < r:
if l & 1:
l_val = self._dot(l_val, self._tree[l])
l += 1
if r & 1:
r -= 1
r_val = self._dot(self._tree[r], r_val)
l >>= 1
r >>= 1
return self._dot(l_val, r_val)
def main():
n,Q = map(int,input().split())
C = list(map(int,input().split()))
graph = [[] for _ in range(n)]
for i in range(n-1):
a,b = map(int,input().split())
a -= 1; b -= 1
graph[a].append(b)
graph[b].append(a)
idx = 0
start = 0
euler = []
left = [-1] * n #()
right = [-1] * n #()
depth = [-1] * n
par = [-1] * n
depth[start] = 0 #0
stack = []
stack.append(~start) #
stack.append(start) #
while stack:
v = stack.pop()
if v >= 0:
euler.append(v)
if left[v] == -1:
left[v] = idx
idx += 1
d = depth[v]
for u in graph[v]:
if par[v] == u:
continue
par[u] = v
depth[u] = d + 1
stack.append(~u) #
stack.append(u)
else:
a = ~v #
if right[a] == -1:
right[a] = idx
#euler.append(a)
#idx += 1
#print(euler) #INDEXINDEX
#print(left)
#print(right)
NC = [-1]*n; dic = {} #INDEXINDEX
for i in range(n):
idx = left[i]
dic[idx] = i
cval = C[i]
NC[idx] = cval
#print(NC)
Tree = SegmentTree(NC,segfunc,0)
for _ in range(Q):
t,x,y = map(int,input().split())
x -= 1 #0-index
nx = left[x]
if t == 1:
val = Tree.__getitem__(nx)^y
Tree.update(nx,val)
else:
#ret = []
#for i in range(n):
# ret.append(Tree.__getitem__(i))
#print(ret)
ans = Tree.sum(left[x],right[x])
print(ans)
if __name__ == '__main__':
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0