結果

問題 No.738 平らな農地
ユーザー 👑 obakyanobakyan
提出日時 2022-01-02 20:30:28
言語 Lua
(LuaJit 2.1.1696795921)
結果
WA  
実行時間 -
コード長 3,831 bytes
コンパイル時間 284 ms
コンパイル使用メモリ 5,120 KB
実行使用メモリ 16,196 KB
最終ジャッジ日時 2024-04-20 05:17:37
合計ジャッジ時間 14,381 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 WA -
testcase_04 AC 2 ms
5,376 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 AC 5 ms
5,376 KB
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 WA -
testcase_61 WA -
testcase_62 WA -
testcase_63 WA -
testcase_64 WA -
testcase_65 AC 34 ms
5,904 KB
testcase_66 AC 34 ms
5,892 KB
testcase_67 WA -
testcase_68 AC 229 ms
16,068 KB
testcase_69 WA -
testcase_70 WA -
testcase_71 AC 23 ms
5,376 KB
testcase_72 AC 27 ms
5,376 KB
testcase_73 AC 27 ms
5,376 KB
testcase_74 AC 27 ms
5,376 KB
testcase_75 WA -
testcase_76 WA -
testcase_77 WA -
testcase_78 WA -
testcase_79 WA -
testcase_80 WA -
testcase_81 AC 277 ms
15,936 KB
testcase_82 AC 317 ms
16,064 KB
testcase_83 AC 67 ms
5,376 KB
testcase_84 WA -
testcase_85 WA -
testcase_86 WA -
testcase_87 AC 146 ms
15,940 KB
testcase_88 AC 140 ms
16,068 KB
testcase_89 AC 1 ms
5,376 KB
testcase_90 AC 1 ms
5,376 KB
testcase_91 AC 2 ms
5,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.addValue = function(self, idx, value, silent)
  self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] + value
  if not silent then
    self:update(idx)
  end
end
SegTree.lower_bound = function(self, val)
  local ret, retpos = self.emptyvalue, 0
  local stagenum = self.stagenum
  local stage, l, r = 1, 1, bls(1, stagenum - 1)
  while true do
    local sz = bls(1, stagenum - stage)
    local tmp = self.func(ret, self.stage[stage][mce(l / sz)])
    if tmp < val then
      ret, retpos = tmp, l + sz - 1
      if l + sz <= r then stage, l = stage + 1, l + sz
      else break
      end
    else
      if sz ~= 1 then stage, r = stage + 1, l + sz - 2
      else break
      end
    end
  end
  return retpos + 1
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 a = {}
local amap = {}
for i = 1, n do
  a[i] = io.read("*n")
  amap[a[i]] = true
end
if k == 1 then print(0) os.exit() end
local hk = mce(k / 2)
local auniq = {}
for p, q in pairs(amap) do
  table.insert(auniq, p)
end
table.sort(auniq)
local an = #auniq
for i = 1, an do
  amap[auniq[i]] = i
end
local stcnt = SegTree.new(an, function(x, y) return x + y end, 0)
local stval = SegTree.new(an, function(x, y) return x + y end, 0)
for i = 1, k do
  local val = a[i]
  local pos = amap[val]
  stcnt:addValue(pos, 1)
  stval:addValue(pos, val)
end
local function check()
  local lb = stcnt:lower_bound(hk)
  local left_cnt = lb == 1 and 0 or stcnt:getRange(1, lb - 1)
  local left_sum = lb == 1 and 0 or stval:getRange(1, lb - 1)
  local right_cnt = stcnt:getRange(lb, an)
  local right_sum = stval:getRange(lb, an)
  return right_sum - right_cnt * auniq[lb] + left_cnt * auniq[lb] - left_sum
end
local ret = check()
for i = k + 1, n do
  local val = a[i]
  local pos = amap[val]
  stcnt:addValue(pos, 1)
  stval:addValue(pos, val)
  val = a[i - k]
  stcnt:addValue(pos, -1)
  stval:addValue(pos, -val)
  ret = mmi(ret, check())
end
print(ret)
0