結果
問題 | No.433 ICPC国内予選の選抜ルールがこんな感じだったらうれしい |
ユーザー | 👑 obakyan |
提出日時 | 2020-05-03 18:40:06 |
言語 | Lua (LuaJit 2.1.1696795921) |
結果 |
AC
|
実行時間 | 383 ms / 4,000 ms |
コード長 | 2,999 bytes |
コンパイル時間 | 152 ms |
コンパイル使用メモリ | 5,212 KB |
実行使用メモリ | 21,568 KB |
最終ジャッジ日時 | 2023-09-04 04:38:27 |
合計ジャッジ時間 | 13,516 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 356 ms
21,464 KB |
testcase_01 | AC | 309 ms
21,372 KB |
testcase_02 | AC | 200 ms
21,108 KB |
testcase_03 | AC | 254 ms
21,020 KB |
testcase_04 | AC | 255 ms
21,016 KB |
testcase_05 | AC | 245 ms
20,964 KB |
testcase_06 | AC | 383 ms
21,440 KB |
testcase_07 | AC | 228 ms
21,568 KB |
testcase_08 | AC | 201 ms
21,128 KB |
testcase_09 | AC | 216 ms
20,760 KB |
testcase_10 | AC | 261 ms
20,676 KB |
testcase_11 | AC | 288 ms
20,176 KB |
testcase_12 | AC | 280 ms
20,728 KB |
testcase_13 | AC | 215 ms
20,748 KB |
testcase_14 | AC | 265 ms
21,068 KB |
testcase_15 | AC | 240 ms
20,656 KB |
testcase_16 | AC | 333 ms
20,276 KB |
testcase_17 | AC | 307 ms
20,648 KB |
testcase_18 | AC | 320 ms
20,984 KB |
testcase_19 | AC | 218 ms
21,000 KB |
testcase_20 | AC | 236 ms
20,580 KB |
testcase_21 | AC | 223 ms
20,672 KB |
testcase_22 | AC | 289 ms
20,508 KB |
testcase_23 | AC | 249 ms
20,412 KB |
testcase_24 | AC | 212 ms
20,600 KB |
testcase_25 | AC | 275 ms
20,372 KB |
testcase_26 | AC | 262 ms
20,588 KB |
testcase_27 | AC | 312 ms
20,208 KB |
testcase_28 | AC | 206 ms
20,900 KB |
testcase_29 | AC | 327 ms
20,752 KB |
testcase_30 | AC | 29 ms
12,384 KB |
testcase_31 | AC | 30 ms
12,376 KB |
testcase_32 | AC | 296 ms
20,756 KB |
testcase_33 | AC | 282 ms
20,412 KB |
testcase_34 | AC | 206 ms
20,956 KB |
testcase_35 | AC | 29 ms
12,476 KB |
testcase_36 | AC | 31 ms
12,196 KB |
testcase_37 | AC | 30 ms
12,260 KB |
testcase_38 | AC | 30 ms
12,192 KB |
testcase_39 | AC | 33 ms
12,448 KB |
testcase_40 | AC | 32 ms
12,432 KB |
testcase_41 | AC | 47 ms
13,040 KB |
testcase_42 | AC | 47 ms
13,128 KB |
testcase_43 | AC | 49 ms
13,108 KB |
testcase_44 | AC | 49 ms
13,148 KB |
testcase_45 | AC | 32 ms
12,352 KB |
testcase_46 | AC | 61 ms
13,148 KB |
testcase_47 | AC | 59 ms
13,032 KB |
ソースコード
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