結果
問題 | No.610 区間賞(Section Award) |
ユーザー |
👑 |
提出日時 | 2021-06-10 22:33:13 |
言語 | Lua (LuaJit 2.1.1734355927) |
結果 |
AC
|
実行時間 | 175 ms / 2,000 ms |
コード長 | 2,490 bytes |
コンパイル時間 | 135 ms |
コンパイル使用メモリ | 6,688 KB |
実行使用メモリ | 11,008 KB |
最終ジャッジ日時 | 2024-11-30 09:41:21 |
合計ジャッジ時間 | 4,919 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 50 |
ソースコード
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.setValue = function(self, idx, value, silent)self.stage[self.stagenum][idx] = valueif not silent thenself:update(idx)endendSegTree.new = function(n, func, emptyvalue)local obj = {}setmetatable(obj, {__index = SegTree})obj:create(n, func, emptyvalue)return objendlocal n = io.read("*n")local st = SegTree.new(n, bit.bor, 0)local a = {}local ainv = {}local ret = {}for i = 1, n doainv[i] = 0endfor i = 1, n doa[i] = io.read("*n")ainv[a[i]] = iendfor i = 1, n dolocal b = io.read("*n")local start_rank = ainv[b]if st:getRange(start_rank, n) == 0 thentable.insert(ret, b)endst:setValue(start_rank, 1)endtable.sort(ret)print(table.concat(ret, "\n"))