結果

問題 No.2139 K Consecutive Sushi
ユーザー 👑 obakyanobakyan
提出日時 2022-12-08 23:47:30
言語 Lua
(LuaJit 2.1.1696795921)
結果
AC  
実行時間 143 ms / 2,000 ms
コード長 2,484 bytes
コンパイル時間 174 ms
コンパイル使用メモリ 5,456 KB
実行使用メモリ 12,576 KB
最終ジャッジ日時 2023-08-04 20:27:39
合計ジャッジ時間 3,762 ms
ジャッジサーバーID
(参考情報)
judge13 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 118 ms
12,476 KB
testcase_04 AC 143 ms
12,436 KB
testcase_05 AC 115 ms
12,420 KB
testcase_06 AC 95 ms
12,368 KB
testcase_07 AC 114 ms
12,436 KB
testcase_08 AC 110 ms
12,568 KB
testcase_09 AC 114 ms
12,392 KB
testcase_10 AC 121 ms
12,460 KB
testcase_11 AC 121 ms
12,576 KB
testcase_12 AC 111 ms
12,344 KB
testcase_13 AC 1 ms
4,376 KB
testcase_14 AC 1 ms
4,376 KB
testcase_15 AC 2 ms
4,376 KB
testcase_16 AC 1 ms
4,376 KB
testcase_17 AC 2 ms
4,376 KB
testcase_18 AC 2 ms
4,376 KB
testcase_19 AC 2 ms
4,376 KB
testcase_20 AC 3 ms
4,376 KB
testcase_21 AC 2 ms
4,380 KB
testcase_22 AC 2 ms
4,380 KB
testcase_23 AC 12 ms
4,376 KB
testcase_24 AC 38 ms
4,768 KB
testcase_25 AC 90 ms
12,556 KB
testcase_26 AC 11 ms
4,376 KB
testcase_27 AC 32 ms
4,804 KB
testcase_28 AC 31 ms
4,904 KB
testcase_29 AC 15 ms
4,380 KB
testcase_30 AC 40 ms
7,436 KB
testcase_31 AC 113 ms
12,444 KB
testcase_32 AC 16 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

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
  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)
0