結果
| 問題 |
No.1099 Range Square Sum
|
| コンテスト | |
| ユーザー |
👑 |
| 提出日時 | 2020-12-01 00:03:42 |
| 言語 | Lua (LuaJit 2.1.1734355927) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 4,203 bytes |
| コンパイル時間 | 234 ms |
| コンパイル使用メモリ | 7,068 KB |
| 実行使用メモリ | 78,924 KB |
| 最終ジャッジ日時 | 2024-09-13 02:43:30 |
| 合計ジャッジ時間 | 19,937 ms |
|
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | WA * 1 |
| other | WA * 25 TLE * 5 |
ソースコード
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 LazyRangeSeg = {}
LazyRangeSeg.updateAll = function(self)
for i = self.stagenum - 1, 1, -1 do
local cnt = bls(1, i - 1)
for j = 1, cnt do
self.lin[i][j] = self.lin[i + 1][j * 2 - 1] + self.lin[i + 1][j * 2]
self.sq[i][j] = self.sq[i + 1][j * 2 - 1] + self.sq[i + 1][j * 2]
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, 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.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
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 + bls(1, stagenum - i)
if p < right then
offset = p
p = p + bls(1, stagenum - i)
end
if right < p then
local curidx = brs(p, stagenum - i)
local lzval = lazy[i][curidx]
if lzval ~= 0 then
local sz = bls(1, stagenum - i - 1)
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
elseif p == right then
break
else
assert(false)
end
end
end
LazyRangeSeg.resolveRange = function(self, stagepos, idx, value, shallow)
local linadd = bls(1, self.stagenum - stagepos) * value
self.sq[stagepos][idx] = self.sq[stagepos][idx] + linadd * value + 2 * self.lin[stagepos][idx] * value
self.lin[stagepos][idx] = self.lin[stagepos][idx] + linadd
if shallow then return end
local lin, sq = self.lin, self.sq
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 + bls(1, stagenum - stage)
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.sq, 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 + bls(1, stagenum - stage)
end
end
local n = io.read("*n", "*l")
local lzst = LazyRangeSeg
lzst:create(n)
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)
val = val:sub(1, #val - 2)
print(val)
end
end
-- print(os.clock())