結果

問題 No.318 学学学学学
ユーザー 👑 obakyan
提出日時 2020-05-02 16:21:30
言語 Lua
(LuaJit 2.1.1734355927)
結果
AC  
実行時間 369 ms / 2,000 ms
コード長 3,043 bytes
コンパイル時間 341 ms
コンパイル使用メモリ 5,504 KB
実行使用メモリ 40,688 KB
最終ジャッジ日時 2024-12-30 09:39:14
合計ジャッジ時間 6,539 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

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, n do self.stage[stagenum][i] = i end
  for i = n + 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.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 spos, epos = {}, {}
local uniqtbl = {}
for i = 1, n do
  local a = io.read("*n")
  if not spos[a] then
    spos[a] = i
    epos[a] = i + 1
    table.insert(uniqtbl, a)
  else
    epos[a] = i + 1
  end
end
table.sort(uniqtbl)
local m = #uniqtbl
local sevent = {}
local eevent = {}
for i = 1, n + 1 do
  sevent[i] = {}
  eevent[i] = {}
end
local state = {}
for i = 1, m do
  state[i] = false
  local aval = uniqtbl[i]
  local sp, ep = spos[aval], epos[aval]
  table.insert(sevent[sp], i)
  table.insert(eevent[ep], i)
end
state[m + 1] = false
local function mergefunc(a, b)
  if not state[a] then return b
  elseif not state[b] then return a
  else
    return a < b and b or a
  end
end
local st = SegTree.new(m, mergefunc, m + 1)
for i = 1, n do
  for j = 1, #sevent[i] do
    state[sevent[i][j]] = true
    st:update(sevent[i][j])
  end
  for j = 1, #eevent[i] do
    state[eevent[i][j]] = false
    st:update(eevent[i][j])
  end
  local v = st.stage[1][1]
  local aval = uniqtbl[v]
  io.write(aval)
  io.write(i == n and "\n" or " ")
end
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0