結果

問題 No.1558 Derby Live
ユーザー 👑 obakyanobakyan
提出日時 2021-07-22 16:26:23
言語 Lua
(LuaJit 2.1.1696795921)
結果
RE  
実行時間 -
コード長 3,050 bytes
コンパイル時間 156 ms
コンパイル使用メモリ 5,400 KB
実行使用メモリ 21,132 KB
最終ジャッジ日時 2023-09-24 14:12:28
合計ジャッジ時間 4,161 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 RE -
testcase_01 AC 454 ms
21,132 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 RE -
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 RE -
testcase_17 RE -
testcase_18 RE -
testcase_19 RE -
testcase_20 RE -
testcase_21 RE -
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 RE -
testcase_27 RE -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 RE -
testcase_33 AC 1 ms
4,376 KB
testcase_34 AC 1 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

local mab = math.abs
local mfl, mce = math.floor, math.ceil
local mmi, mma = math.min, math.max
local bls, brs = bit.lshift, bit.rshift
local SegTree = {}
SegTree.initAll = function(self)
  for i = self.stagenum, 1, -1 do
    local cnt = bls(1, i - 1)
    for j = 1, cnt do
      self.stage[i][j] = {}
      for k = 1, self.c do
        self.stage[i][j][k] = k
      end
    end
  end
end
SegTree.func = function(self, dst, src1, src2)
  for i = 1, self.c do
    dst[i] = src2[src1[i]]
  end
end
SegTree.create = function(self, c, n)
  self.c = c
  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
  self:initAll()
end
SegTree.getRange = function(self, left, right)
  assert(left == 1)
  if left == right then return self.stage[self.stagenum][left] end
  local stagenum = self.stagenum
  local ret = {}
  for i = 1, self.c do ret[i] = i end
  local tmp = {}
  for i = 1, self.c do tmp[i] = i end
  while left <= right do
    local stage = mma(self.left_stage[left], self.sz_stage[right - left + 1])
    local sz = bls(1, stagenum - stage)
    self:func(tmp, ret, self.stage[stage][1 + brs(left - 1, stagenum - stage)])
    for i = 1, self.c do
      ret[i] = tmp[i]
    end
    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
    if rem < idx then idx, rem = rem, idx end
    self:func(self.stage[i][dst], self.stage[i + 1][idx], self.stage[i + 1][rem])
    idx = dst
  end
end
SegTree.setValue = function(self, idx, ary)
  for i = 1, self.c do
    self.stage[self.stagenum][idx][i] = ary[i]
  end
  self:update(idx)
end
SegTree.new = function(c, n)
  local obj = {}
  setmetatable(obj, {__index = SegTree})
  obj:create(c, n)
  return obj
end
local c, n, q = io.read("*n", "*n", "*n")
local st = SegTree.new(c, n)
local ary = {}
local ainv = {}
for i = 1, c do ainv[i] = 0 end

for iq = 1, q do
  local tp = io.read("*n")
  if tp == 1 then
    local p = io.read("*n")
    for i = 1, c do
      ary[i] = io.read("*n")
    end
    st:setValue(p, ary)
  elseif tp == 2 then
    local p = io.read("*n")
    local ret = st:getRange(1, p)
    for i = 1, c do
      ainv[ret[i]] = i
    end
    print(table.concat(ainv, " "))
  else
    local x, y = io.read("*n", "*n")
    local ret1 = nil
    if 1 < x then
      st:getRange(1, x - 1)
    else
      ret1 = {}
      for i = 1, c do ret1[i] = i end
    end
    local ret2 = st:getRange(1, y)
    local ans = 0
    for i = 1, c do
      ans = ans + mab(ret1[i] - ret2[i])
    end
    print(ans)
  end
end
0