結果

問題 No.1705 Mode of long array
ユーザー 👑 obakyanobakyan
提出日時 2022-03-11 00:00:25
言語 Lua
(LuaJit 2.1.1696795921)
結果
AC  
実行時間 446 ms / 3,000 ms
コード長 2,943 bytes
コンパイル時間 368 ms
コンパイル使用メモリ 5,332 KB
実行使用メモリ 26,716 KB
最終ジャッジ日時 2023-10-13 02:19:59
合計ジャッジ時間 16,680 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,372 KB
testcase_01 AC 2 ms
4,500 KB
testcase_02 AC 1 ms
4,368 KB
testcase_03 AC 5 ms
4,372 KB
testcase_04 AC 5 ms
4,368 KB
testcase_05 AC 5 ms
4,368 KB
testcase_06 AC 13 ms
4,376 KB
testcase_07 AC 16 ms
4,372 KB
testcase_08 AC 14 ms
4,372 KB
testcase_09 AC 14 ms
4,368 KB
testcase_10 AC 13 ms
4,372 KB
testcase_11 AC 14 ms
4,376 KB
testcase_12 AC 14 ms
4,372 KB
testcase_13 AC 267 ms
21,948 KB
testcase_14 AC 178 ms
14,152 KB
testcase_15 AC 150 ms
5,580 KB
testcase_16 AC 190 ms
6,196 KB
testcase_17 AC 133 ms
5,700 KB
testcase_18 AC 113 ms
5,812 KB
testcase_19 AC 231 ms
9,624 KB
testcase_20 AC 139 ms
8,900 KB
testcase_21 AC 191 ms
18,288 KB
testcase_22 AC 311 ms
23,156 KB
testcase_23 AC 119 ms
4,352 KB
testcase_24 AC 119 ms
4,372 KB
testcase_25 AC 119 ms
4,348 KB
testcase_26 AC 120 ms
4,352 KB
testcase_27 AC 114 ms
4,348 KB
testcase_28 AC 120 ms
4,356 KB
testcase_29 AC 119 ms
4,352 KB
testcase_30 AC 118 ms
4,352 KB
testcase_31 AC 119 ms
4,348 KB
testcase_32 AC 118 ms
4,356 KB
testcase_33 AC 421 ms
26,672 KB
testcase_34 AC 425 ms
26,652 KB
testcase_35 AC 440 ms
26,660 KB
testcase_36 AC 446 ms
26,576 KB
testcase_37 AC 428 ms
26,600 KB
testcase_38 AC 436 ms
26,616 KB
testcase_39 AC 424 ms
26,712 KB
testcase_40 AC 429 ms
26,716 KB
testcase_41 AC 435 ms
26,668 KB
testcase_42 AC 436 ms
26,580 KB
testcase_43 AC 176 ms
15,512 KB
testcase_44 AC 191 ms
15,552 KB
testcase_45 AC 189 ms
15,628 KB
testcase_46 AC 190 ms
15,572 KB
testcase_47 AC 195 ms
15,512 KB
testcase_48 AC 190 ms
15,632 KB
testcase_49 AC 299 ms
25,444 KB
testcase_50 AC 301 ms
25,436 KB
testcase_51 AC 294 ms
25,352 KB
testcase_52 AC 312 ms
25,452 KB
testcase_53 AC 297 ms
25,288 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, n do self.stage[stagenum][i] = i end
  for i = n + 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.new = function(n, func, emptyvalue)
  local obj = {}
  setmetatable(obj, {__index = SegTree})
  obj:create(n, func, emptyvalue)
  return obj
end

local ffi = require("ffi")
local C = ffi.C
ffi.cdef[[
long long atoll(const char*);
]]

local function lltonumber(str)
  return C.atoll(str)
end

local n, m = io.read():match("(%d+) (%d+)")
n = lltonumber(n)
m = tonumber(m)
local a = {}
local s = io.read()
for w in s:gmatch("%d+") do
  table.insert(a, lltonumber(w))
end
a[m + 1] = -1LL
local function comp(x, y)
  if a[x] ~= a[y] then
    return a[x] < a[y] and y or x
  else
    return x < y and y or x
  end
end
local st = SegTree.new(m, comp, m + 1)
local q = io.read("*n", "*l")
for iq = 1, q do
  local tp, x, y = io.read():match("(%d+) (%d+) (%d+)")
  tp = tonumber(tp)
  x = tonumber(x)
  y = lltonumber(y)
  if tp == 1 then
    a[x] = a[x] + y
    st:update(x)
  elseif tp == 2 then
    a[x] = a[x] - y
    st:update(x)
  else
    print(st.stage[1][1])
  end
end
0