結果

問題 No.610 区間賞(Section Award)
ユーザー 👑 obakyanobakyan
提出日時 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
権限があれば一括ダウンロードができます

ソースコード

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.setValue = function(self, idx, value, silent)
self.stage[self.stagenum][idx] = value
if not silent then
self:update(idx)
end
end
SegTree.new = function(n, func, emptyvalue)
local obj = {}
setmetatable(obj, {__index = SegTree})
obj:create(n, func, emptyvalue)
return obj
end
local n = io.read("*n")
local st = SegTree.new(n, bit.bor, 0)
local a = {}
local ainv = {}
local ret = {}
for i = 1, n do
ainv[i] = 0
end
for i = 1, n do
a[i] = io.read("*n")
ainv[a[i]] = i
end
for i = 1, n do
local b = io.read("*n")
local start_rank = ainv[b]
if st:getRange(start_rank, n) == 0 then
table.insert(ret, b)
end
st:setValue(start_rank, 1)
end
table.sort(ret)
print(table.concat(ret, "\n"))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0