結果

問題 No.877 Range ReLU Query
ユーザー 👑 obakyanobakyan
提出日時 2019-09-07 09:13:42
言語 Lua
(LuaJit 2.1.1696795921)
結果
AC  
実行時間 1,127 ms / 2,000 ms
コード長 2,872 bytes
コンパイル時間 198 ms
コンパイル使用メモリ 6,944 KB
実行使用メモリ 92,288 KB
最終ジャッジ日時 2024-04-25 22:09:48
合計ジャッジ時間 11,510 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 6 ms
6,820 KB
testcase_02 AC 6 ms
6,940 KB
testcase_03 AC 7 ms
6,940 KB
testcase_04 AC 4 ms
6,944 KB
testcase_05 AC 4 ms
6,940 KB
testcase_06 AC 4 ms
6,940 KB
testcase_07 AC 4 ms
6,944 KB
testcase_08 AC 7 ms
6,940 KB
testcase_09 AC 3 ms
6,940 KB
testcase_10 AC 6 ms
6,944 KB
testcase_11 AC 1,055 ms
79,744 KB
testcase_12 AC 933 ms
71,296 KB
testcase_13 AC 732 ms
55,552 KB
testcase_14 AC 752 ms
55,168 KB
testcase_15 AC 1,127 ms
85,632 KB
testcase_16 AC 1,056 ms
81,536 KB
testcase_17 AC 1,104 ms
83,584 KB
testcase_18 AC 1,097 ms
83,200 KB
testcase_19 AC 895 ms
92,288 KB
testcase_20 AC 1,043 ms
88,832 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

local mfl, mce, mmi = math.floor, math.ceil, math.min
local SegTree = {}
SegTree.updateAll = function(self)
  for i = self.stagenum - 1, 1, -1 do
    for j = 1, self.cnt[i] do
      self.stage[i][j] = {0, 0}
    end
  end
end
SegTree.create = function(self, ary, func, emptyvalue)
  self.func2, self.emptyvalue = func, emptyvalue
  local stagenum, mul = 1, 1
  self.cnt, self.stage, self.size = {1}, {{}}, {}
  while mul < #ary do
    mul, stagenum = mul * 2, stagenum + 1
    self.cnt[stagenum], self.stage[stagenum] = mul, {}
  end
  for i = 1, stagenum do self.size[i] = self.cnt[stagenum + 1 - i] end
  self.stagenum = stagenum
  for i = 1, #ary do self.stage[stagenum][i] = ary[i] end
  for i = #ary + 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][1], self.stage[self.stagenum][left][2] end
  local start_stage = 1
  while right - left + 1 < self.size[start_stage] do
    start_stage = start_stage + 1
  end
  local ret = {0, 0}
  local t1, t2, t3 = {start_stage}, {left}, {right}
  while 0 < #t1 do
    local stage, l, r = t1[#t1], t2[#t1], t3[#t1]
    table.remove(t1) table.remove(t2) table.remove(t3)
    local sz = self.size[stage]
    if (l - 1) % sz ~= 0 then
      local newr = mmi(r, mce((l - 1) / sz) * sz)
      table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, newr)
      l = newr + 1
    end
    if sz <= r + 1 - l then
      self.func2(ret, ret, self.stage[stage][mce(l / sz)])
      l = l + sz
    end
    if l <= r then
      table.insert(t1, stage + 1) table.insert(t2, l) table.insert(t3, r)
    end
  end
  return ret[1], ret[2]
end
SegTree.setValue = function(self, idx, value)
  self.stage[self.stagenum][idx] = {value, 1}
  for i = self.stagenum - 1, 1, -1 do
    local dst = mce(idx / 2)
    local rem = dst * 4 - 1 - idx
    self.func2(self.stage[i][dst], self.stage[i + 1][idx], self.stage[i + 1][rem])
    idx = dst
  end
end
SegTree.new = function(ary, func, emptyvalue)
  local obj = {}
  setmetatable(obj, {__index = SegTree})
  obj:create(ary, func, emptyvalue)
  return obj
end

local n, q = io.read("*n", "*n")
local a = {}
for i = 1, n do a[i] = {io.read("*n"), i} end
for i = 1, q do
  local _u, l, r, x = io.read("*n", "*n", "*n", "*n")
  a[n + i] = {x, n + i, l, r}
end
table.sort(a, function(x, y) return x[1] > y[1] end)
local stary = {}
for i = 1, n do stary[i] = {0, 0} end
local st = SegTree.new(stary, function(z, x, y) z[1], z[2] = x[1] + y[1], x[2] + y[2] end, {0, 0})
local z = {}
for i = 1, n + q do
  if a[i][2] <= n then
    st:setValue(a[i][2], a[i][1])
  else
    local g, h = st:getRange(a[i][3], a[i][4])
    a[i][1] = g - a[i][1] * h
    table.insert(z, a[i])
  end
end
table.sort(z, function(x, y) return x[2] < y[2] end)
for i = 1, q do
  print(z[i][1])
end
0