結果
問題 | No.1115 二つの数列 / Two Sequences |
ユーザー | 👑 obakyan |
提出日時 | 2021-08-04 23:45:40 |
言語 | Lua (LuaJit 2.1.1696795921) |
結果 |
AC
|
実行時間 | 112 ms / 2,000 ms |
コード長 | 2,385 bytes |
コンパイル時間 | 146 ms |
コンパイル使用メモリ | 5,156 KB |
実行使用メモリ | 7,376 KB |
最終ジャッジ日時 | 2023-10-14 21:26:31 |
合計ジャッジ時間 | 5,395 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 9 ms
4,372 KB |
testcase_01 | AC | 1 ms
4,356 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 99 ms
7,324 KB |
testcase_04 | AC | 103 ms
7,280 KB |
testcase_05 | AC | 99 ms
7,320 KB |
testcase_06 | AC | 83 ms
7,260 KB |
testcase_07 | AC | 112 ms
7,316 KB |
testcase_08 | AC | 7 ms
4,352 KB |
testcase_09 | AC | 61 ms
4,732 KB |
testcase_10 | AC | 95 ms
7,180 KB |
testcase_11 | AC | 1 ms
4,348 KB |
testcase_12 | AC | 105 ms
7,376 KB |
testcase_13 | AC | 105 ms
7,376 KB |
testcase_14 | AC | 105 ms
7,180 KB |
testcase_15 | AC | 1 ms
4,352 KB |
testcase_16 | AC | 1 ms
4,372 KB |
testcase_17 | AC | 1 ms
4,348 KB |
testcase_18 | AC | 1 ms
4,348 KB |
testcase_19 | AC | 1 ms
4,348 KB |
testcase_20 | AC | 1 ms
4,348 KB |
testcase_21 | AC | 1 ms
4,348 KB |
testcase_22 | AC | 1 ms
4,348 KB |
testcase_23 | AC | 9 ms
4,352 KB |
testcase_24 | AC | 39 ms
4,640 KB |
testcase_25 | AC | 83 ms
7,360 KB |
testcase_26 | AC | 19 ms
4,348 KB |
testcase_27 | AC | 48 ms
4,676 KB |
testcase_28 | AC | 69 ms
4,644 KB |
testcase_29 | AC | 91 ms
7,284 KB |
testcase_30 | AC | 108 ms
7,232 KB |
testcase_31 | AC | 26 ms
4,348 KB |
testcase_32 | AC | 17 ms
4,352 KB |
testcase_33 | AC | 90 ms
7,288 KB |
testcase_34 | AC | 1 ms
4,356 KB |
testcase_35 | AC | 2 ms
4,352 KB |
testcase_36 | AC | 1 ms
4,368 KB |
testcase_37 | AC | 1 ms
4,348 KB |
testcase_38 | AC | 1 ms
4,368 KB |
testcase_39 | AC | 2 ms
4,372 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, 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 t = {} for i = 1, n do t[i] = 0 end for i = 1, n do local a = io.read("*n") t[a] = i end local ret = 0 local st = SegTree.new(n, function(a, b) return a + b end, 0) for i = 1, n do local b = io.read("*n") b = t[b] ret = ret + st:getRange(b, n) st:setValue(b, 1) end print(ret)