結果
問題 | No.2139 K Consecutive Sushi |
ユーザー | 👑 obakyan |
提出日時 | 2022-12-08 23:47:30 |
言語 | Lua (LuaJit 2.1.1696795921) |
結果 |
AC
|
実行時間 | 142 ms / 2,000 ms |
コード長 | 2,484 bytes |
コンパイル時間 | 289 ms |
コンパイル使用メモリ | 5,248 KB |
実行使用メモリ | 12,928 KB |
最終ジャッジ日時 | 2024-05-05 19:23:46 |
合計ジャッジ時間 | 3,024 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 123 ms
12,928 KB |
testcase_04 | AC | 142 ms
12,928 KB |
testcase_05 | AC | 124 ms
12,928 KB |
testcase_06 | AC | 100 ms
12,928 KB |
testcase_07 | AC | 119 ms
12,800 KB |
testcase_08 | AC | 118 ms
12,928 KB |
testcase_09 | AC | 123 ms
12,928 KB |
testcase_10 | AC | 135 ms
12,928 KB |
testcase_11 | AC | 126 ms
12,928 KB |
testcase_12 | AC | 125 ms
12,928 KB |
testcase_13 | AC | 1 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 1 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 3 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 3 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 3 ms
5,376 KB |
testcase_23 | AC | 13 ms
5,376 KB |
testcase_24 | AC | 39 ms
5,376 KB |
testcase_25 | AC | 99 ms
12,928 KB |
testcase_26 | AC | 12 ms
5,376 KB |
testcase_27 | AC | 35 ms
5,376 KB |
testcase_28 | AC | 33 ms
5,376 KB |
testcase_29 | AC | 17 ms
5,376 KB |
testcase_30 | AC | 44 ms
7,808 KB |
testcase_31 | AC | 121 ms
12,928 KB |
testcase_32 | AC | 17 ms
5,376 KB |
testcase_33 | AC | 129 ms
12,928 KB |
ソースコード
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 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 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 = mma(self.left_stage[left], self.sz_stage[right - left + 1]) local sz = bls(1, stagenum - stage) ret = self.func(ret, self.stage[stage][1 + brs(left - 1, stagenum - stage)]) 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 self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem]) idx = dst end end SegTree.setValue = function(self, idx, value, silent) self.stage[self.stagenum][idx] = value if not silent then self:update(idx) end end SegTree.new = function(n, func, emptyvalue) local obj = {} setmetatable(obj, {__index = SegTree}) obj:create(n, func, emptyvalue) return obj end local n, k = io.read("*n", "*n") local sum = 0 local a = {} for i = 1, n do a[i] = io.read("*n") sum = sum + a[i] end local inf = 1000000007 * 200010 local st = SegTree.new(n, mmi, inf) for i = 1, k do st:setValue(i, a[i]) end for i = k + 1, n do local v = st:getRange(i - k, i - 1) st:setValue(i, a[i] + v) end local ans = sum - st:getRange(n + 1 - k, n) ans = tostring(1LL * ans):gsub("LL", "") print(ans)