結果

問題 No.1099 Range Square Sum
ユーザー 👑 obakyanobakyan
提出日時 2021-07-26 23:27:48
言語 Lua
(LuaJit 2.1.1696795921)
結果
TLE  
実行時間 -
コード長 4,457 bytes
コンパイル時間 379 ms
コンパイル使用メモリ 6,940 KB
実行使用メモリ 77,828 KB
最終ジャッジ日時 2024-07-22 14:13:43
合計ジャッジ時間 4,508 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 1 ms
6,940 KB
testcase_11 AC 12 ms
6,940 KB
testcase_12 AC 12 ms
6,940 KB
testcase_13 AC 10 ms
6,940 KB
testcase_14 AC 10 ms
6,940 KB
testcase_15 AC 10 ms
6,940 KB
testcase_16 AC 10 ms
6,944 KB
testcase_17 AC 11 ms
6,940 KB
testcase_18 AC 12 ms
6,940 KB
testcase_19 AC 11 ms
6,940 KB
testcase_20 AC 10 ms
6,944 KB
testcase_21 TLE -
testcase_22 TLE -
testcase_23 TLE -
testcase_24 TLE -
testcase_25 TLE -
testcase_26 AC 1,759 ms
77,384 KB
testcase_27 AC 1,759 ms
77,196 KB
testcase_28 AC 1,768 ms
77,324 KB
testcase_29 AC 1,760 ms
77,388 KB
testcase_30 AC 1,846 ms
77,384 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

local mfl, mce = math.floor, math.ceil
local bls, brs = bit.lshift, bit.rshift
local function mma(a, b) return a < b and b or a end
local p2 = {1}
for i = 2, 28 do
  p2[i] = p2[i - 1] * 2
end
local LazyRangeSeg = {}
LazyRangeSeg.updateAll = function(self)
  local lin, sq = self.lin, self.sq
  local lz = self.lazy
  for i = self.stagenum - 1, 1, -1 do
    local cnt = p2[i]
    for j = 1, cnt do
      lin[i][j] = lin[i + 1][j * 2 - 1] + lin[i + 1][j * 2]
      sq[i][j] = sq[i + 1][j * 2 - 1] + sq[i + 1][j * 2]
      lz[i][j] = 0
    end
  end
end
LazyRangeSeg.create = function(self, n)
  local stagenum, mul = 1, 1
  self.lin = {{0}}
  self.sq = {{0LL}}
  self.lazy = {{0}}
  while mul < n do
    mul, stagenum = mul * 2, stagenum + 1
    self.lin[stagenum] = {}
    self.sq[stagenum] = {}
    self.lazy[stagenum] = {}
    -- for i = 1, mul do
      -- self.lin[stagenum][i] = 0
      -- self.sq[stagenum][i] = 0LL
      -- self.lazy[stagenum][i] = 0
    -- end
  end
  self.left_stage = {}
  for i = 1, n do
    local sp, sz = 1, p2[stagenum]
    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.stagenum = stagenum
  local z = io.read()
  local i = 0
  for a in z:gmatch("%-?%d+") do
    i = i + 1
    a = tonumber(a)
    self.lin[stagenum][i] = a
    self.sq[stagenum][i] = 1LL * a * a
    self.lazy[stagenum][i] = 0
  end
  for i = n + 1, mul do
    self.lin[stagenum][i] = 0
    self.sq[stagenum][i] = 0
    self.lazy[stagenum][i] = 0
  end
  self:updateAll()
end
LazyRangeSeg.resolve = function(self, right)
  local stagenum = self.stagenum
  local offset = 0
  local lazy = self.lazy
  for i = 1, stagenum - 1 do
    local p = offset + p2[stagenum - i + 1]
    if p < right then
      offset = p
      p = p + p2[stagenum - i + 1]
    end
    if right < p then
      local curidx = brs(p, stagenum - i)
      local lzval = lazy[i][curidx]
      if lzval ~= 0 then
        local sz = p2[stagenum - i]
        self:resolveRange(i + 1, curidx * 2 - 1, lzval, true)
        self:resolveRange(i + 1, curidx * 2, lzval, true)
        lazy[i + 1][curidx * 2 - 1] = lazy[i + 1][curidx * 2 - 1] + lzval
        lazy[i + 1][curidx * 2] = lazy[i + 1][curidx * 2] + lzval
        lazy[i][curidx] = 0
      end
    else--p==right
      break
    end
  end
end

LazyRangeSeg.resolveRange = function(self, stagepos, idx, value, shallow)
  local linadd = p2[self.stagenum - stagepos + 1] * value
  local lin, sq = self.lin, self.sq
  sq[stagepos][idx] = sq[stagepos][idx] + (linadd + 2LL * lin[stagepos][idx]) * value
  lin[stagepos][idx] = lin[stagepos][idx] + linadd
  if shallow then return end
  for i = stagepos - 1, 1, -1 do
    local dst = brs(idx + 1, 1)
    local rem = dst * 4 - 1 - idx
    lin[i][dst] = lin[i + 1][idx] + lin[i + 1][rem]
    sq[i][dst] = sq[i + 1][idx] + sq[i + 1][rem]
    idx = dst
  end
end
LazyRangeSeg.getRange = function(self, left, right)
  if 1 < left then self:resolve(left - 1) end
  self:resolve(right)
  local stagenum = self.stagenum
  local ret = 0LL
  local sq, ls, szs = self.sq, self.left_stage, self.sz_stage
  while left <= right do
    local stage = mma(ls[left], szs[right - left + 1])
    ret = ret + sq[stage][1 + brs(left - 1, stagenum - stage)]
    left = left + p2[stagenum - stage + 1]
  end
  return ret
end
LazyRangeSeg.setRange = function(self, left, right, value)
  if 1 < left then self:resolve(left - 1) end
  self:resolve(right)
  local stagenum = self.stagenum
  local lazy, ls, szs = self.lazy, self.left_stage, self.sz_stage
  while left <= right do
    local stage = mma(ls[left], szs[right - left + 1])
    local idx = 1 + brs(left - 1, stagenum - stage)
    self:resolveRange(stage, idx, value)
    lazy[stage][idx] = lazy[stage][idx] + value
    left = left + p2[stagenum - stage + 1]
  end
end

local n = io.read("*n", "*l")
local lzst = LazyRangeSeg
lzst:create(n)
local retall = {}
local q = io.read("*n")
for iq = 1, q do
  local tp = io.read("*n")
  if tp == 1 then
    local l, r, x = io.read("*n", "*n", "*n")
    lzst:setRange(l, r, x)
  else
    local l, r = io.read("*n", "*n")
    local val = lzst:getRange(l, r)
    val = tostring(val):gsub("LL", "")
    -- print(val)
    table.insert(retall, val)
  end
end
print(table.concat(retall, "\n"))
-- print(os.clock())
0