結果

問題 No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい
ユーザー 👑 obakyanobakyan
提出日時 2020-05-03 18:40:06
言語 Lua
(LuaJit 2.1.1696795921)
結果
AC  
実行時間 236 ms / 4,000 ms
コード長 2,999 bytes
コンパイル時間 114 ms
コンパイル使用メモリ 6,692 KB
実行使用メモリ 28,032 KB
最終ジャッジ日時 2024-06-22 04:09:17
合計ジャッジ時間 9,823 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 220 ms
27,904 KB
testcase_01 AC 186 ms
28,032 KB
testcase_02 AC 138 ms
27,776 KB
testcase_03 AC 179 ms
27,776 KB
testcase_04 AC 181 ms
27,776 KB
testcase_05 AC 159 ms
27,776 KB
testcase_06 AC 236 ms
28,032 KB
testcase_07 AC 154 ms
28,032 KB
testcase_08 AC 138 ms
27,776 KB
testcase_09 AC 159 ms
27,648 KB
testcase_10 AC 190 ms
27,264 KB
testcase_11 AC 207 ms
27,008 KB
testcase_12 AC 197 ms
27,264 KB
testcase_13 AC 162 ms
27,264 KB
testcase_14 AC 199 ms
27,520 KB
testcase_15 AC 177 ms
27,264 KB
testcase_16 AC 231 ms
27,008 KB
testcase_17 AC 228 ms
27,392 KB
testcase_18 AC 226 ms
27,648 KB
testcase_19 AC 164 ms
27,520 KB
testcase_20 AC 173 ms
27,392 KB
testcase_21 AC 163 ms
27,264 KB
testcase_22 AC 199 ms
27,136 KB
testcase_23 AC 179 ms
27,264 KB
testcase_24 AC 165 ms
27,136 KB
testcase_25 AC 205 ms
27,136 KB
testcase_26 AC 195 ms
27,264 KB
testcase_27 AC 227 ms
26,880 KB
testcase_28 AC 157 ms
27,520 KB
testcase_29 AC 235 ms
27,392 KB
testcase_30 AC 27 ms
15,872 KB
testcase_31 AC 27 ms
15,872 KB
testcase_32 AC 207 ms
27,520 KB
testcase_33 AC 214 ms
27,136 KB
testcase_34 AC 142 ms
27,776 KB
testcase_35 AC 27 ms
15,744 KB
testcase_36 AC 27 ms
15,872 KB
testcase_37 AC 26 ms
15,872 KB
testcase_38 AC 26 ms
15,872 KB
testcase_39 AC 28 ms
16,000 KB
testcase_40 AC 31 ms
16,128 KB
testcase_41 AC 41 ms
17,024 KB
testcase_42 AC 41 ms
17,024 KB
testcase_43 AC 41 ms
16,896 KB
testcase_44 AC 40 ms
16,896 KB
testcase_45 AC 28 ms
16,000 KB
testcase_46 AC 51 ms
17,024 KB
testcase_47 AC 50 ms
17,024 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, 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, value)
  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, k = io.read("*n", "*n")
local lim = 100000
local univ = {}
local univpos = {}
for i = 1, lim + 1 do
  univ[i] = {}
  univpos[i] = 1
end
for i = 1, n do
  local s, p, u = io.read("*n", "*n", "*n")
  table.insert(univ[u], {s, p, i - 1})
end
local function sortfunc(a, b)
  if a[1] ~= b[1] then
    return a[1] > b[1]
  else
    return a[2] < b[2]
  end
end
for i = 1, lim do
  table.sort(univ[i], sortfunc)
end

local function mergefunc(a, b)
  if #univ[a] < univpos[a] then return b
  elseif #univ[b] < univpos[b] then return a
  end
  local upa, upb = univpos[a], univpos[b]
  local z = univ[a][upa][1] - univ[b][upb][1]
  if z < 0 then
    return b
  elseif 0 < z then
    return a
  end
  if upa < upb then
    return a
  elseif upb < upa then
    return b
  end
  return univ[a][upa][2] < univ[b][upb][2] and a or b
end

local st = SegTree.new(lim, mergefunc, lim + 1)
for i = 1, k do
  local u = st.stage[1][1]
  local upos = univpos[u]
  print(univ[u][upos][3])
  univpos[u] = upos + 1
  st:update(u)
end
0