結果
問題 | No.865 24時間降水量 |
ユーザー |
👑 |
提出日時 | 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 |
ソースコード
local mfl, mce = math.floor, math.ceillocal mmi, mma = math.min, math.maxlocal bls, brs = bit.lshift, bit.rshiftlocal SegTree = {}SegTree.updateAll = function(self)for i = self.stagenum - 1, 1, -1 dolocal cnt = bls(1, i - 1)for j = 1, cnt doself.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])endendendSegTree.create = function(self, n, func, emptyvalue)self.func, self.emptyvalue = func, emptyvaluelocal stagenum, mul = 1, 1self.stage = {{}}while mul < n domul, stagenum = mul * 2, stagenum + 1self.stage[stagenum] = {}endself.stagenum = stagenumfor i = 1, mul do self.stage[stagenum][i] = emptyvalue endself:updateAll()endSegTree.getRange = function(self, left, right)if left == right then return self.stage[self.stagenum][left] endlocal stagenum = self.stagenumlocal ret = self.emptyvaluewhile left <= right dolocal stage, sz = 1, bls(1, stagenum - 1)local len = right - left + 1while (left - 1) % sz ~= 0 or len < sz dostage, sz = stage + 1, brs(sz, 1)endret = self.func(ret, self.stage[stage][1 + brs(left - 1, stagenum - stage)])left = left + szendreturn retendSegTree.addValue = function(self, idx, value, silent)self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] + valueif not silent thenfor i = self.stagenum - 1, 1, -1 dolocal dst = brs(idx + 1, 1)local rem = dst * 4 - 1 - idxself.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])idx = dstendendendSegTree.new = function(n, func, emptyvalue)local obj = {}setmetatable(obj, {__index = SegTree})obj:create(n, func, emptyvalue)return objendlocal n = io.read("*n")local a = {}for i = 1, n doa[i] = io.read("*n")endlocal st = SegTree.new(n - 23, mma, 0)for i = 1, n - 23 dolocal s = 0for j = i, i + 23 dos = s + a[j]endst:addValue(i, s, true)endst:updateAll()local q = io.read("*n")for iq = 1, q dolocal 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 dost:addValue(i, diff)enda[t] = vprint(st.stage[1][1])end