結果

問題 No.1441 MErGe
ユーザー 👑 obakyanobakyan
提出日時 2021-07-24 19:24:20
言語 Lua
(LuaJit 2.1.1696795921)
結果
AC  
実行時間 700 ms / 1,000 ms
コード長 3,276 bytes
コンパイル時間 111 ms
コンパイル使用メモリ 5,216 KB
実行使用メモリ 32,176 KB
最終ジャッジ日時 2023-09-27 07:34:19
合計ジャッジ時間 13,855 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 6 ms
4,384 KB
testcase_04 AC 7 ms
4,380 KB
testcase_05 AC 17 ms
4,376 KB
testcase_06 AC 18 ms
4,380 KB
testcase_07 AC 17 ms
4,376 KB
testcase_08 AC 179 ms
10,048 KB
testcase_09 AC 180 ms
10,112 KB
testcase_10 AC 289 ms
11,488 KB
testcase_11 AC 260 ms
7,068 KB
testcase_12 AC 284 ms
11,436 KB
testcase_13 AC 489 ms
23,616 KB
testcase_14 AC 504 ms
23,988 KB
testcase_15 AC 535 ms
24,804 KB
testcase_16 AC 491 ms
23,684 KB
testcase_17 AC 479 ms
23,748 KB
testcase_18 AC 613 ms
32,176 KB
testcase_19 AC 700 ms
31,824 KB
testcase_20 AC 524 ms
29,792 KB
testcase_21 AC 469 ms
17,588 KB
testcase_22 AC 673 ms
20,788 KB
testcase_23 AC 685 ms
28,700 KB
testcase_24 AC 678 ms
28,616 KB
testcase_25 AC 679 ms
28,668 KB
testcase_26 AC 693 ms
28,732 KB
testcase_27 AC 677 ms
28,692 KB
testcase_28 AC 275 ms
14,604 KB
testcase_29 AC 281 ms
14,564 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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] = 1 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.lower_bound = function(self, val)
  local ret, retpos = self.emptyvalue, 0
  local stagenum = self.stagenum
  local stage, l, r = 1, 1, bls(1, stagenum - 1)
  while true do
    local sz = bls(1, stagenum - stage)
    local tmp = self.func(ret, self.stage[stage][mce(l / sz)])
    if tmp < val then
      ret, retpos = tmp, l + sz - 1
      if l + sz <= r then stage, l = stage + 1, l + sz
      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.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 a = {}
for i = 1, n do
  a[i] = io.read("*n")
end
local asum = {a[1]}
for i = 2, n do
  asum[i] = asum[i - 1] + a[i]
end

local st = SegTree.new(n, function(a, b) return a + b end, 0)

for iq = 1, q do
  local tp, l, r = io.read("*n", "*n", "*n")
  if tp == 1 then
    for i = l + 1, r do
      local pos = st:lower_bound(l + 1)
      st:setValue(pos, 0)
    end
  else
    local p1 = st:lower_bound(l)
    local p2 = st:lower_bound(r + 1) - 1
    if n < p2 then p2 = n end
    local v = asum[p2]
    if 1 < p1 then v = v - asum[p1 - 1] end
    v = tostring(1LL * v):gsub("LL", "")
    print(v)
  end
end
-- print(os.clock())
0