結果

問題 No.1641 Tree Xor Query
コンテスト
ユーザー 👑 obakyan
提出日時 2021-08-06 22:18:19
言語 Lua
(LuaJit 2.1.1734355927)
結果
AC  
実行時間 2,430 ms / 5,000 ms
コード長 3,755 bytes
コンパイル時間 302 ms
コンパイル使用メモリ 6,940 KB
実行使用メモリ 103,424 KB
最終ジャッジ日時 2024-09-17 02:20:53
合計ジャッジ時間 6,836 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff # 

local mfl, mce = math.floor, math.ceil
local mmi, mma = math.min, math.max
local bxor = bit.bxor
local bls, brs = bit.lshift, bit.rshift
local SegTree = {}
SegTree.updateAll = function(self)
  for i = self.stagenum - 1, 1, -1 do
    local cnt = bls(1, i - 1)
    for j = 1, cnt do
      self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])
    end
  end
end
SegTree.create = function(self, n, func, emptyvalue)
  self.func, self.emptyvalue = func, emptyvalue
  local stagenum, mul = 1, 1
  self.stage = {{}}
  while mul < n do
    mul, stagenum = mul * 2, stagenum + 1
    self.stage[stagenum] = {}
  end
  self.stagenum = stagenum
  self.left_stage = {}
  for i = 1, n do
    local sp, sz = 1, bls(1, stagenum - 1)
    while(i - 1) % sz ~= 0 do
      sp, sz = sp + 1, brs(sz, 1)
    end
    self.left_stage[i] = sp
  end
  self.sz_stage = {}
  local tmp, sp = 1, stagenum
  for i = 1, n do
    if tmp * 2 == i then tmp, sp = tmp * 2, sp - 1 end
    self.sz_stage[i] = sp
  end
  for i = 1, mul do self.stage[stagenum][i] = emptyvalue end
  self:updateAll()
end
SegTree.getRange = function(self, left, right)
  if left == right then return self.stage[self.stagenum][left] end
  local stagenum = self.stagenum
  local ret = self.emptyvalue
  while left <= right do
    local stage = mma(self.left_stage[left], self.sz_stage[right - left + 1])
    local sz = bls(1, stagenum - stage)
    ret = self.func(ret, self.stage[stage][1 + brs(left - 1, stagenum - stage)])
    left = left + sz
  end
  return ret
end
SegTree.update = function(self, idx)
  for i = self.stagenum - 1, 1, -1 do
    local dst = brs(idx + 1, 1)
    local rem = dst * 4 - 1 - idx
    self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])
    idx = dst
  end
end
SegTree.setValue = function(self, idx, value, silent)
  self.stage[self.stagenum][idx] = value
  if not silent then
    self:update(idx)
  end
end
SegTree.new = function(n, func, emptyvalue)
  local obj = {}
  setmetatable(obj, {__index = SegTree})
  obj:create(n, func, emptyvalue)
  return obj
end

local n = io.read("*n")
local q = io.read("*n")
local c = {}
for i = 1, n do
  c[i] = io.read("*n")
end
local edge = {}
local asked = {}
local cpos = {}
local len = {}
local stleft, stright = {}, {}
for i = 1, n do
  edge[i] = {}
  asked[i] = false
  cpos[i] = 0
  len[i] = 0
  stleft[i] = 0
  stright[i] = 0
end
len[n + 1] = 1000000007
for i = 1, n - 1 do
  local x, y = io.read("*n", "*n")
  table.insert(edge[x], y)
  table.insert(edge[y], x)
end

local tasks = {1}
local sti = 1
while 0 < #tasks do
  local src = tasks[#tasks]
  table.remove(tasks)
  asked[src] = true
  if stleft[src] == 0 then
    stleft[src] = sti
  end
  stright[src] = sti
  sti = sti + 1
  while cpos[src] < #edge[src] do
    cpos[src] = cpos[src] + 1
    local dst = edge[src][cpos[src]]
    if not asked[dst] then
      len[dst] = len[src] + 1
      table.insert(tasks, src)
      table.insert(tasks, dst)
      break
    end
  end
end
local st = {}
for i = 1, 10 do
  st[i] = SegTree.new(2 * n - 1, function(a, b) return a + b end, 0)
end
for i = 1, n do
  local v = c[i]
  for j = 1, 10 do
    if v % 2 == 1 then
      st[j]:setValue(stleft[i], 1, true)
    end
    v = mfl(v / 2)
  end
end
for i = 1, 10 do st[i]:updateAll() end

for iq = 1, q do
  local tp, x, y = io.read("*n", "*n", "*n")
  if tp == 1 then
    c[x] = bxor(c[x], y)
    local v = c[x]
    for j = 1, 10 do
      st[j]:setValue(stleft[x], v % 2)
      v = mfl(v / 2)
    end
  else
    local mul = 1
    local ret = 0
    local stl, str = stleft[x], stright[x]
    for i = 1, 10 do
      if st[i]:getRange(stl, str) % 2 == 1 then
        ret = ret + mul
      end
      mul = mul * 2
    end
    print(ret)
  end
end
0