結果
問題 | No.2248 max(C)-min(C) |
ユーザー | 👑 obakyan |
提出日時 | 2023-07-29 23:14:56 |
言語 | Lua (LuaJit 2.1.1696795921) |
結果 |
AC
|
実行時間 | 479 ms / 3,000 ms |
コード長 | 2,145 bytes |
コンパイル時間 | 497 ms |
コンパイル使用メモリ | 5,376 KB |
実行使用メモリ | 15,104 KB |
最終ジャッジ日時 | 2024-04-17 01:36:29 |
合計ジャッジ時間 | 16,746 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 5 ms
5,376 KB |
testcase_04 | AC | 4 ms
5,376 KB |
testcase_05 | AC | 3 ms
5,376 KB |
testcase_06 | AC | 5 ms
5,376 KB |
testcase_07 | AC | 5 ms
5,376 KB |
testcase_08 | AC | 6 ms
5,376 KB |
testcase_09 | AC | 11 ms
5,376 KB |
testcase_10 | AC | 5 ms
5,376 KB |
testcase_11 | AC | 5 ms
5,376 KB |
testcase_12 | AC | 4 ms
5,376 KB |
testcase_13 | AC | 4 ms
5,376 KB |
testcase_14 | AC | 6 ms
5,376 KB |
testcase_15 | AC | 5 ms
5,376 KB |
testcase_16 | AC | 9 ms
5,376 KB |
testcase_17 | AC | 5 ms
5,376 KB |
testcase_18 | AC | 384 ms
10,880 KB |
testcase_19 | AC | 39 ms
5,376 KB |
testcase_20 | AC | 464 ms
14,976 KB |
testcase_21 | AC | 423 ms
15,104 KB |
testcase_22 | AC | 270 ms
10,880 KB |
testcase_23 | AC | 160 ms
6,784 KB |
testcase_24 | AC | 58 ms
5,376 KB |
testcase_25 | AC | 405 ms
14,976 KB |
testcase_26 | AC | 345 ms
10,880 KB |
testcase_27 | AC | 398 ms
14,976 KB |
testcase_28 | AC | 30 ms
5,376 KB |
testcase_29 | AC | 367 ms
10,880 KB |
testcase_30 | AC | 124 ms
6,784 KB |
testcase_31 | AC | 452 ms
14,976 KB |
testcase_32 | AC | 66 ms
5,376 KB |
testcase_33 | AC | 112 ms
5,760 KB |
testcase_34 | AC | 447 ms
15,104 KB |
testcase_35 | AC | 454 ms
14,976 KB |
testcase_36 | AC | 461 ms
14,976 KB |
testcase_37 | AC | 205 ms
8,832 KB |
testcase_38 | AC | 458 ms
14,976 KB |
testcase_39 | AC | 460 ms
14,976 KB |
testcase_40 | AC | 464 ms
14,976 KB |
testcase_41 | AC | 361 ms
10,880 KB |
testcase_42 | AC | 453 ms
15,104 KB |
testcase_43 | AC | 400 ms
15,104 KB |
testcase_44 | AC | 459 ms
14,976 KB |
testcase_45 | AC | 325 ms
10,880 KB |
testcase_46 | AC | 149 ms
6,784 KB |
testcase_47 | AC | 452 ms
14,976 KB |
testcase_48 | AC | 202 ms
14,976 KB |
testcase_49 | AC | 433 ms
14,976 KB |
testcase_50 | AC | 479 ms
14,976 KB |
testcase_51 | AC | 448 ms
14,976 KB |
testcase_52 | AC | 449 ms
14,976 KB |
testcase_53 | AC | 57 ms
5,376 KB |
ソースコード
local mmi, mma = math.min, math.max local mfl, mce = math.floor, math.ceil local bls, brs = bit.lshift, bit.rshift local Heapq = {} Heapq.create = function(self, lt) self.lt = lt self.cnt = 0 self.t = {} end Heapq.push = function(self, v) local hqlt = self.lt local hqt = self.t local c = self.cnt + 1 self.cnt = c hqt[c] = v while 1 < c do local p = brs(c, 1) if hqlt(hqt[c], hqt[p]) then hqt[c], hqt[p] = hqt[p], hqt[c] c = p else break end end end Heapq.pop = function(self) local hqlt = self.lt local hqt = self.t local ret = hqt[1] local c = self.cnt hqt[1] = hqt[c] c = c - 1 self.cnt = c local p = 1 while true do local d1, d2 = p * 2, p * 2 + 1 if c < d1 then break elseif c < d2 then if hqlt(hqt[d1], hqt[p]) then hqt[d1], hqt[p] = hqt[p], hqt[d1] end break else if hqlt(hqt[d1], hqt[d2]) then if hqlt(hqt[d1], hqt[p]) then hqt[d1], hqt[p] = hqt[p], hqt[d1] p = d1 else break end else if hqlt(hqt[d2], hqt[p]) then hqt[d2], hqt[p] = hqt[p], hqt[d2] p = d2 else break end end end end return ret end Heapq.new = function(lt) local obj = {} setmetatable(obj, {__index = Heapq}) obj:create(lt) return obj end local n = io.read("*n") local a, b = {}, {} for i = 1, n do a[i] = io.read("*n") end for i = 1, n do b[i] = io.read("*n") a[n + i] = mfl((a[i] + b[i]) / 2) if b[i] < a[i] then a[i], b[i] = b[i], a[i] end end for i = 1, n do a[2 * n + i] = b[i] end local curmax = 0 local hq = Heapq.new(function(x, y) return a[x] < a[y] end) local bmin = 1000000007 local bmax = 0 for i = 1, n do curmax = mma(curmax, a[i]) hq:push(i) end local ans = 1000000007 for i = 1, 2 * n do local z = hq:pop() local curmin = mmi(bmin, a[z]) ans = mmi(ans, curmax - curmin) if z <= n then hq:push(n + z) curmax = mma(curmax, a[n + z]) else curmax = mma(curmax, a[n + z]) bmin = mmi(bmin, a[n + z]) bmax = mma(bmax, a[n + z]) end end ans = mmi(ans, bmax - bmin) print(ans)