#759934 (Lua) No.1332 Range Nearest Query

提出ソース

結果

問題	No.1332 Range Nearest Query
ユーザー	👑 obakyan
提出日時	2022-05-11 23:31:38
言語	Lua (LuaJit 2.1.1696795921)
結果	AC
実行時間	904 ms / 2,500 ms
コード長	4,928 bytes
コンパイル時間	462 ms
コンパイル使用メモリ	5,100 KB
実行使用メモリ	70,252 KB
最終ジャッジ日時	2023-09-26 15:23:12
合計ジャッジ時間	40,992 ms
ジャッジサーバーID （参考情報）	judge15 / judge11

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,384 KB
testcase_01	AC	1 ms 4,384 KB
testcase_02	AC	2 ms 4,384 KB
testcase_03	AC	764 ms 43,568 KB
testcase_04	AC	743 ms 43,700 KB
testcase_05	AC	747 ms 43,420 KB
testcase_06	AC	872 ms 70,220 KB
testcase_07	AC	871 ms 70,216 KB
testcase_08	AC	861 ms 70,116 KB
testcase_09	AC	867 ms 70,252 KB
testcase_10	AC	874 ms 70,216 KB
testcase_11	AC	865 ms 70,248 KB
testcase_12	AC	854 ms 70,216 KB
testcase_13	AC	858 ms 70,244 KB
testcase_14	AC	864 ms 70,244 KB
testcase_15	AC	875 ms 70,128 KB
testcase_16	AC	876 ms 65,480 KB
testcase_17	AC	897 ms 65,248 KB
testcase_18	AC	904 ms 65,456 KB
testcase_19	AC	881 ms 65,316 KB
testcase_20	AC	887 ms 65,328 KB
testcase_21	AC	893 ms 65,216 KB
testcase_22	AC	900 ms 65,588 KB
testcase_23	AC	867 ms 65,244 KB
testcase_24	AC	870 ms 65,376 KB
testcase_25	AC	881 ms 65,100 KB
testcase_26	AC	599 ms 61,060 KB
testcase_27	AC	670 ms 69,152 KB
testcase_28	AC	125 ms 9,156 KB
testcase_29	AC	121 ms 9,104 KB
testcase_30	AC	123 ms 9,068 KB
testcase_31	AC	105 ms 8,868 KB
testcase_32	AC	126 ms 8,744 KB
testcase_33	AC	126 ms 9,296 KB
testcase_34	AC	112 ms 9,172 KB
testcase_35	AC	116 ms 8,936 KB
testcase_36	AC	114 ms 8,868 KB
testcase_37	AC	121 ms 8,760 KB
testcase_38	AC	587 ms 39,688 KB
testcase_39	AC	268 ms 16,148 KB
testcase_40	AC	865 ms 65,024 KB
testcase_41	AC	365 ms 20,416 KB
testcase_42	AC	555 ms 38,980 KB
testcase_43	AC	431 ms 26,772 KB
testcase_44	AC	722 ms 41,976 KB
testcase_45	AC	644 ms 41,064 KB
testcase_46	AC	495 ms 28,204 KB
testcase_47	AC	599 ms 40,464 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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.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.right_bound = function(self, val, left, right)
  local ret, retpos = self.emptyvalue, 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.func(ret, self.stage[stage][mce(l / sz)])
    if tmp < val then
      ret, retpos = tmp, 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, val, left, right)
  local ret, retpos = self.emptyvalue, 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.func(ret, self.stage[stage][mfl(r / sz)])
    if tmp < val then
      ret, retpos = tmp, 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 function comp(a, b)
  return a < b
end

local function lower_bound(ary, x)
  local num = #ary
  if num == 0 then return 1 end
  if not comp(ary[1], x) then return 1 end
  if comp(ary[num], x) then return num + 1 end
  local min, max = 1, num
  while 1 < max - min do
    local mid = mfl((min + max) / 2)
    if comp(ary[mid], x) then
      min = mid
    else
      max = mid
    end
  end
  return max
end

local n = io.read("*n")
local x = {}
local xuniq = {}
local tasks = {}
for i = 1, n do
  x[i] = io.read("*n")
  xuniq[i] = x[i]
  tasks[i] = {}
end
table.sort(xuniq)
local xmap = {}
for i = 1, n do
  xmap[xuniq[i]] = i
end
local q = io.read("*n")
local l, r, xq = {}, {}, {}
local ans = {}
local inf = 1000000007
for i = 1, q do
  l[i], r[i], xq[i] = io.read("*n", "*n", "*n")
  ans[i] = inf
  table.insert(tasks[r[i]], i)
end
local st = SegTree.new(n, mma, 0)
for i = 1, n do
  local xi = x[i]
  local xpos = xmap[xi]
  st:setValue(xpos, i)
  for j = 1, #tasks[i] do
    local iq = tasks[i][j]
    local li = l[iq]
    local xqi = xq[iq]
    local xqpos = lower_bound(xuniq, xqi)
    local ret = inf
    if 1 < xqpos then
      local left = st:left_bound(li, 1, xqpos - 1)
      if 1 <= left then
        ans[iq] = mmi(ans[iq], xqi - xuniq[left])
      end
    end
    if xqpos <= n then
      local right = st:right_bound(li, xqpos, n)
      if right <= n then
        ans[iq] = mmi(ans[iq], xuniq[right] - xqi)
      end
    end
  end
end
print(table.concat(ans, "\n"))

yukicoder

結果

テストケース

ソースコード