結果
問題 | No.738 平らな農地 |
ユーザー |
👑 |
提出日時 | 2022-01-02 20:34:09 |
言語 | Lua (LuaJit 2.1.1734355927) |
結果 |
AC
|
実行時間 | 397 ms / 2,000 ms |
コード長 | 3,849 bytes |
コンパイル時間 | 120 ms |
コンパイル使用メモリ | 6,696 KB |
実行使用メモリ | 16,072 KB |
最終ジャッジ日時 | 2024-10-12 00:25:32 |
合計ジャッジ時間 | 15,553 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 87 |
ソースコード
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 = stagenumself.left_stage = {}for i = 1, n dolocal sp, sz = 1, bls(1, stagenum - 1)while(i - 1) % sz ~= 0 dosp, sz = sp + 1, brs(sz, 1)endself.left_stage[i] = spendself.sz_stage = {}local tmp, sp = 1, stagenumfor i = 1, n doif tmp * 2 == i then tmp, sp = tmp * 2, sp - 1 endself.sz_stage[i] = spendfor 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 = 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 + szendreturn retendSegTree.update = function(self, idx)for 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 = dstendendSegTree.addValue = function(self, idx, value, silent)self.stage[self.stagenum][idx] = self.stage[self.stagenum][idx] + valueif not silent thenself:update(idx)endendSegTree.lower_bound = function(self, val)local ret, retpos = self.emptyvalue, 0local stagenum = self.stagenumlocal stage, l, r = 1, 1, bls(1, stagenum - 1)while true dolocal sz = bls(1, stagenum - stage)local tmp = self.func(ret, self.stage[stage][mce(l / sz)])if tmp < val thenret, retpos = tmp, l + sz - 1if l + sz <= r then stage, l = stage + 1, l + szelse breakendelseif sz ~= 1 then stage, r = stage + 1, l + sz - 2else breakendendendreturn retpos + 1endSegTree.new = function(n, func, emptyvalue)local obj = {}setmetatable(obj, {__index = SegTree})obj:create(n, func, emptyvalue)return objendlocal n, k = io.read("*n", "*n")local a = {}local amap = {}for i = 1, n doa[i] = io.read("*n")amap[a[i]] = trueendif k == 1 then print(0) os.exit() endlocal hk = mce(k / 2)local auniq = {}for p, q in pairs(amap) dotable.insert(auniq, p)endtable.sort(auniq)local an = #auniqfor i = 1, an doamap[auniq[i]] = iendlocal 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 dolocal val = a[i]local pos = amap[val]stcnt:addValue(pos, 1)stval:addValue(pos, val)endlocal 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_sumendlocal ret = check()for i = k + 1, n dolocal 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())endprint(ret)