結果

問題 No.865 24時間降水量
ユーザー 👑 obakyan
提出日時 2020-04-07 22:19:39
言語 Lua
(LuaJit 2.1.1734355927)
結果
AC  
実行時間 858 ms / 2,000 ms
コード長 2,259 bytes
コンパイル時間 106 ms
コンパイル使用メモリ 5,376 KB
実行使用メモリ 8,704 KB
最終ジャッジ日時 2024-07-08 06:39:14
合計ジャッジ時間 4,215 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

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
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, sz = 1, bls(1, stagenum - 1)
local len = right - left + 1
while (left - 1) % sz ~= 0 or len < sz do
stage, sz = stage + 1, brs(sz, 1)
end
ret = self.func(ret, self.stage[stage][1 + brs(left - 1, stagenum - stage)])
left = left + sz
end
return ret
end
SegTree.addValue = function(self, idx, value, silent)
self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] + value
if not silent then
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
end
SegTree.new = function(n, func, emptyvalue)
local obj = {}
setmetatable(obj, {__index = SegTree})
obj:create(n, func, emptyvalue)
return obj
end
local n = io.read("*n")
local a = {}
for i = 1, n do
a[i] = io.read("*n")
end
local st = SegTree.new(n - 23, mma, 0)
for i = 1, n - 23 do
local s = 0
for j = i, i + 23 do
s = s + a[j]
end
st:addValue(i, s, true)
end
st:updateAll()
local q = io.read("*n")
for iq = 1, q do
local t, v = io.read("*n", "*n")
local diff = v - a[t]
local left = mma(1, t - 23)
local right = mmi(t, n - 23)
for i = left, right do
st:addValue(i, diff)
end
a[t] = v
print(st.stage[1][1])
end
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0