結果

問題 No.833 かっこいい電車
ユーザー 👑 obakyanobakyan
提出日時 2020-05-06 13:50:07
言語 Lua
(LuaJit 2.1.1696795921)
結果
AC  
実行時間 257 ms / 2,000 ms
コード長 4,376 bytes
コンパイル時間 118 ms
コンパイル使用メモリ 5,212 KB
実行使用メモリ 30,804 KB
最終ジャッジ日時 2023-09-11 00:21:37
合計ジャッジ時間 6,628 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 213 ms
15,216 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 1 ms
4,376 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 188 ms
19,576 KB
testcase_11 AC 257 ms
30,784 KB
testcase_12 AC 85 ms
16,532 KB
testcase_13 AC 52 ms
7,168 KB
testcase_14 AC 211 ms
30,804 KB
testcase_15 AC 105 ms
16,684 KB
testcase_16 AC 73 ms
15,996 KB
testcase_17 AC 62 ms
5,112 KB
testcase_18 AC 223 ms
22,128 KB
testcase_19 AC 72 ms
16,052 KB
testcase_20 AC 23 ms
7,752 KB
testcase_21 AC 192 ms
12,848 KB
testcase_22 AC 128 ms
28,344 KB
testcase_23 AC 87 ms
16,644 KB
testcase_24 AC 131 ms
28,436 KB
testcase_25 AC 220 ms
21,940 KB
testcase_26 AC 97 ms
25,540 KB
testcase_27 AC 140 ms
16,588 KB
testcase_28 AC 114 ms
12,132 KB
testcase_29 AC 125 ms
16,712 KB
testcase_30 AC 143 ms
24,824 KB
testcase_31 AC 158 ms
15,164 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] = 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
0