結果
問題 | No.1095 Smallest Kadomatsu Subsequence |
ユーザー |
👑 |
提出日時 | 2021-05-27 21:23:38 |
言語 | Lua (LuaJit 2.1.1734355927) |
結果 |
AC
|
実行時間 | 533 ms / 2,000 ms |
コード長 | 4,081 bytes |
コンパイル時間 | 383 ms |
コンパイル使用メモリ | 6,688 KB |
実行使用メモリ | 27,488 KB |
最終ジャッジ日時 | 2024-11-06 14:28:36 |
合計ジャッジ時間 | 7,354 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
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.clearAll = function(self)for i = self.stagenum, 1, -1 dolocal cnt = bls(1, i - 1)for j = 1, cnt doself.stage[i][j] = self.emptyvalueendendendSegTree.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.setValue = function(self, idx, value, silent)self.stage[self.stagenum][idx] = valueif not silent thenself:update(idx)endendSegTree.right_bound = function(self, val, left, right)local ret, retpos = self.emptyvalue, left - 1local l, r = left, rightlocal stage = mma(self.left_stage[left], self.sz_stage[right - left + 1])local stagenum = self.stagenumwhile 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 retpos == right then break endif l + sz <= r thenl = l + szstage = mma(self.left_stage[l], self.sz_stage[r - l + 1])else break endelseif sz ~= 1 then stage, r = stage + 1, l + sz - 2else break endendendreturn retpos + 1endSegTree.new = function(n, func, emptyvalue)local obj = {}setmetatable(obj, {__index = SegTree})obj:create(n, func, emptyvalue)return objendlocal n = io.read("*n")local a = {}local as = {}local amap = {}for i = 1, n doa[i] = io.read("*n")as[i] = a[i]endtable.sort(as)for i = 1, n doamap[as[i]] = iendlocal inf = 1000000007local leftmin = {a[1]}for i = 2, n doleftmin[i] = mmi(a[i], leftmin[i - 1])endlocal rightmin = {}for i = 1, n do rightmin[i] = 0 endrightmin[n] = a[n]for i = n - 1, 1, -1 dorightmin[i] = mmi(a[i], rightmin[i + 1])endlocal ret = inffor i = 2, n - 1 doif leftmin[i - 1] < a[i] and rightmin[i + 1] < a[i] thenret = mmi(ret, leftmin[i - 1] + a[i] + rightmin[i + 1])endendlocal st = SegTree.new(n, bit.bor, 0)st:setValue(amap[a[1]], 1)local left = {}left[1] = inffor i = 2, n - 1 dolocal lb = st:right_bound(1, amap[a[i]], n)if lb <= n thenleft[i] = as[lb]elseleft[i] = infendst:setValue(amap[a[i]], 1)endst:clearAll()st:setValue(amap[a[n]], 1)for i = n - 1, 2, -1 dolocal lb = st:right_bound(1, amap[a[i]], n)if lb <= n and left[i] < inf thenret = mmi(ret, a[i] + left[i] + as[lb])endst:setValue(amap[a[i]], 1)endprint(ret < inf and ret or -1)