結果

問題 No.875 Range Mindex Query
ユーザー 👑 obakyanobakyan
提出日時 2019-09-06 23:38:01
言語 Lua
(LuaJit 2.1.1696795921)
結果
AC  
実行時間 478 ms / 2,000 ms
コード長 2,674 bytes
コンパイル時間 196 ms
コンパイル使用メモリ 5,336 KB
実行使用メモリ 24,552 KB
最終ジャッジ日時 2023-09-07 02:46:52
合計ジャッジ時間 4,266 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 4 ms
4,380 KB
testcase_02 AC 5 ms
4,376 KB
testcase_03 AC 4 ms
4,380 KB
testcase_04 AC 4 ms
4,376 KB
testcase_05 AC 4 ms
4,376 KB
testcase_06 AC 4 ms
4,380 KB
testcase_07 AC 4 ms
4,376 KB
testcase_08 AC 3 ms
4,380 KB
testcase_09 AC 3 ms
4,376 KB
testcase_10 AC 5 ms
4,376 KB
testcase_11 AC 357 ms
15,536 KB
testcase_12 AC 268 ms
14,720 KB
testcase_13 AC 243 ms
15,976 KB
testcase_14 AC 240 ms
15,624 KB
testcase_15 AC 327 ms
16,084 KB
testcase_16 AC 417 ms
23,576 KB
testcase_17 AC 478 ms
24,552 KB
testcase_18 AC 436 ms
24,492 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] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])
    end
  end
end
SegTree.create = function(self, ary, func, emptyvalue)
  self.func, 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] end
  local start_stage = 1
  while right - left + 1 < self.size[start_stage] do
    start_stage = start_stage + 1
  end
  local ret = self.emptyvalue
  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
      ret = self.func(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
end
SegTree.getValue = function(self, idx)
  return self.stage[self.stagenum][idx]
end
SegTree.setValue = function(self, idx, value)
  self.stage[self.stagenum][idx][2] = value
  for i = self.stagenum - 1, 1, -1 do
    local dst = mce(idx / 2)
    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.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] = {i, io.read("*n")} end
local st = SegTree.new(a, function(x, y) return x[2] < y[2] and x or y end, {0, 200000})
for i = 1, q do
  local tp, l, r = io.read("*n", "*n", "*n")
  if tp == 1 then
    local lv, rv = st:getValue(l)[2], st:getValue(r)[2]
    st:setValue(l, rv) st:setValue(r, lv)
  else
    print(st:getRange(l, r)[1])
  end
end
0