#727833 (Lua) No.738 平らな農地

提出ソース

結果

問題	No.738 平らな農地
ユーザー	👑 obakyan
提出日時	2022-01-02 20:34:09
言語	Lua (LuaJit 2.1.1696795921)
結果	AC
実行時間	382 ms / 2,000 ms
コード長	3,849 bytes
コンパイル時間	224 ms
コンパイル使用メモリ	6,820 KB
実行使用メモリ	16,072 KB
最終ジャッジ日時	2024-04-20 05:25:06
合計ジャッジ時間	14,994 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	1 ms 6,940 KB
testcase_02	AC	1 ms 6,940 KB
testcase_03	AC	1 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	9 ms 6,940 KB
testcase_06	AC	10 ms 6,944 KB
testcase_07	AC	8 ms 6,944 KB
testcase_08	AC	5 ms 6,944 KB
testcase_09	AC	5 ms 6,940 KB
testcase_10	AC	4 ms 6,940 KB
testcase_11	AC	6 ms 6,940 KB
testcase_12	AC	4 ms 6,944 KB
testcase_13	AC	7 ms 6,944 KB
testcase_14	AC	5 ms 6,944 KB
testcase_15	AC	209 ms 10,120 KB
testcase_16	AC	202 ms 10,096 KB
testcase_17	AC	235 ms 10,128 KB
testcase_18	AC	236 ms 10,116 KB
testcase_19	AC	287 ms 10,116 KB
testcase_20	AC	214 ms 10,076 KB
testcase_21	AC	268 ms 10,112 KB
testcase_22	AC	218 ms 10,100 KB
testcase_23	AC	260 ms 10,124 KB
testcase_24	AC	275 ms 10,116 KB
testcase_25	AC	5 ms 6,940 KB
testcase_26	AC	5 ms 6,944 KB
testcase_27	AC	5 ms 6,944 KB
testcase_28	AC	5 ms 6,944 KB
testcase_29	AC	5 ms 6,944 KB
testcase_30	AC	5 ms 6,944 KB
testcase_31	AC	5 ms 6,940 KB
testcase_32	AC	5 ms 6,944 KB
testcase_33	AC	5 ms 6,940 KB
testcase_34	AC	5 ms 6,940 KB
testcase_35	AC	5 ms 6,944 KB
testcase_36	AC	5 ms 6,940 KB
testcase_37	AC	6 ms 6,944 KB
testcase_38	AC	6 ms 6,940 KB
testcase_39	AC	5 ms 6,940 KB
testcase_40	AC	5 ms 6,940 KB
testcase_41	AC	5 ms 6,944 KB
testcase_42	AC	5 ms 6,944 KB
testcase_43	AC	5 ms 6,944 KB
testcase_44	AC	5 ms 6,944 KB
testcase_45	AC	217 ms 14,720 KB
testcase_46	AC	210 ms 10,116 KB
testcase_47	AC	208 ms 14,720 KB
testcase_48	AC	194 ms 10,112 KB
testcase_49	AC	183 ms 10,100 KB
testcase_50	AC	203 ms 14,708 KB
testcase_51	AC	228 ms 14,608 KB
testcase_52	AC	204 ms 10,112 KB
testcase_53	AC	203 ms 14,704 KB
testcase_54	AC	227 ms 14,708 KB
testcase_55	AC	232 ms 14,708 KB
testcase_56	AC	218 ms 14,708 KB
testcase_57	AC	200 ms 10,100 KB
testcase_58	AC	211 ms 14,708 KB
testcase_59	AC	212 ms 14,700 KB
testcase_60	AC	208 ms 14,732 KB
testcase_61	AC	212 ms 14,708 KB
testcase_62	AC	202 ms 10,100 KB
testcase_63	AC	238 ms 14,580 KB
testcase_64	AC	214 ms 14,720 KB
testcase_65	AC	35 ms 6,944 KB
testcase_66	AC	35 ms 6,944 KB
testcase_67	AC	244 ms 16,068 KB
testcase_68	AC	241 ms 15,940 KB
testcase_69	AC	306 ms 15,944 KB
testcase_70	AC	270 ms 15,940 KB
testcase_71	AC	24 ms 6,944 KB
testcase_72	AC	27 ms 6,940 KB
testcase_73	AC	27 ms 6,940 KB
testcase_74	AC	27 ms 6,944 KB
testcase_75	AC	290 ms 16,064 KB
testcase_76	AC	264 ms 15,940 KB
testcase_77	AC	313 ms 16,068 KB
testcase_78	AC	320 ms 16,068 KB
testcase_79	AC	329 ms 15,936 KB
testcase_80	AC	255 ms 16,068 KB
testcase_81	AC	290 ms 16,068 KB
testcase_82	AC	331 ms 15,940 KB
testcase_83	AC	80 ms 6,940 KB
testcase_84	AC	38 ms 6,940 KB
testcase_85	AC	382 ms 16,064 KB
testcase_86	AC	336 ms 16,072 KB
testcase_87	AC	151 ms 16,064 KB
testcase_88	AC	141 ms 15,940 KB
testcase_89	AC	1 ms 6,944 KB
testcase_90	AC	1 ms 6,940 KB
testcase_91	AC	2 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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]
  pos = amap[val]
  stcnt:addValue(pos, -1)
  stval:addValue(pos, -val)
  ret = mmi(ret, check())
end
print(ret)

yukicoder

結果

テストケース

ソースコード