local mfl, mce = math.floor, math.ceil local mmi, mma = math.min, math.max 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.addValue = function(self, idx, value, silent) self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] + value if not silent then 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 end SegTree.setValue = function(self, idx, value, silent) self.stage[self.stagenum][idx] = value if not silent then 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 end SegTree.right_bound = function(self, left, right) local retpos = left - 1 local l, r = left, right local stage = mma(self.left_stage[left], self.sz_stage[right - left + 1]) local stagenum = self.stagenum while true do local sz = bls(1, stagenum - stage) local tmp = self.stage[stage][mce(l / sz)] if not tmp then retpos = l + sz - 1 if retpos == right then break end if l + sz <= r then l = l + sz stage = mma(self.left_stage[l], self.sz_stage[r - l + 1]) else break end else if sz ~= 1 then stage, r = stage + 1, l + sz - 2 else break end end end return retpos + 1 end SegTree.left_bound = function(self, left, right) local retpos = right + 1 local stage, l, r = 1, left, right local stagenum = self.stagenum while true do local sz = bls(1, stagenum - stage) while r % sz ~= 0 or r + 1 - l < sz do stage = stage + 1 sz = bls(1, stagenum - stage) end local tmp = self.stage[stage][mfl(r / sz)] if not tmp then retpos = r - sz + 1 if l + sz <= r then stage, l, r = 1, l, r - sz else break end else if sz ~= 1 then stage, l, r = stage + 1, r - sz + 2, r else break end end end return retpos - 1 end SegTree.new = function(n, func, emptyvalue) local obj = {} setmetatable(obj, {__index = SegTree}) obj:create(n, func, emptyvalue) return obj end local n, q = io.read("*n", "*n") local stVal = SegTree.new(n, function(a, b) return a + b end, 0LL) local stPos = SegTree.new(n, function(a, b) return a or b end, true) for i = 1, n do local a = io.read("*n") stVal:addValue(i, 1LL * a, true) end stVal:updateAll() for iq = 1, q do local tp, x = io.read("*n", "*n") if tp == 1 then stPos:setValue(x + 1, false) elseif tp == 2 then stPos:setValue(x + 1, true) elseif tp == 3 then stVal:addValue(x, 1LL) else local rightPos = x == n and n or stPos:right_bound(x + 1, n) - 1 local leftPos = stPos:left_bound(1, x) local ret = stVal:getRange(leftPos, rightPos) local str = tostring(ret):gsub("LL", "") print(str) end end