結果

問題 No.610 区間賞(Section Award)
ユーザー 👑 obakyanobakyan
提出日時 2021-06-10 22:33:13
言語 Lua
(LuaJit 2.1.1696795921)
結果
AC  
実行時間 164 ms / 2,000 ms
コード長 2,490 bytes
コンパイル時間 106 ms
コンパイル使用メモリ 5,248 KB
実行使用メモリ 11,008 KB
最終ジャッジ日時 2024-05-07 15:44:01
合計ジャッジ時間 5,261 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 3 ms
5,376 KB
testcase_07 AC 3 ms
5,376 KB
testcase_08 AC 3 ms
5,376 KB
testcase_09 AC 3 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 3 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 3 ms
5,376 KB
testcase_14 AC 3 ms
5,376 KB
testcase_15 AC 3 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 24 ms
5,376 KB
testcase_20 AC 120 ms
8,960 KB
testcase_21 AC 16 ms
5,376 KB
testcase_22 AC 78 ms
5,632 KB
testcase_23 AC 10 ms
5,376 KB
testcase_24 AC 28 ms
5,376 KB
testcase_25 AC 8 ms
5,376 KB
testcase_26 AC 47 ms
5,760 KB
testcase_27 AC 117 ms
8,832 KB
testcase_28 AC 109 ms
8,832 KB
testcase_29 AC 71 ms
5,760 KB
testcase_30 AC 98 ms
8,960 KB
testcase_31 AC 48 ms
5,760 KB
testcase_32 AC 108 ms
8,960 KB
testcase_33 AC 15 ms
5,376 KB
testcase_34 AC 124 ms
8,832 KB
testcase_35 AC 54 ms
5,760 KB
testcase_36 AC 119 ms
8,960 KB
testcase_37 AC 98 ms
8,832 KB
testcase_38 AC 24 ms
5,376 KB
testcase_39 AC 116 ms
8,960 KB
testcase_40 AC 119 ms
8,960 KB
testcase_41 AC 111 ms
8,960 KB
testcase_42 AC 114 ms
8,832 KB
testcase_43 AC 112 ms
8,960 KB
testcase_44 AC 139 ms
11,008 KB
testcase_45 AC 164 ms
11,008 KB
testcase_46 AC 162 ms
11,008 KB
testcase_47 AC 94 ms
8,960 KB
testcase_48 AC 89 ms
8,960 KB
testcase_49 AC 102 ms
8,960 KB
権限があれば一括ダウンロードができます

ソースコード

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"))
0