結果
問題 | No.1036 Make One With GCD 2 |
ユーザー | 👑 obakyan |
提出日時 | 2020-04-25 10:22:16 |
言語 | Lua (LuaJit 2.1.1696795921) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,282 bytes |
コンパイル時間 | 277 ms |
コンパイル使用メモリ | 6,940 KB |
実行使用メモリ | 65,596 KB |
最終ジャッジ日時 | 2024-04-24 19:14:03 |
合計ジャッジ時間 | 32,723 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,361 ms
61,488 KB |
testcase_01 | AC | 343 ms
43,360 KB |
testcase_02 | AC | 626 ms
44,408 KB |
testcase_03 | AC | 42 ms
7,552 KB |
testcase_04 | AC | 74 ms
12,184 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 122 ms
23,084 KB |
testcase_08 | AC | 101 ms
21,148 KB |
testcase_09 | AC | 865 ms
47,984 KB |
testcase_10 | AC | 859 ms
47,096 KB |
testcase_11 | AC | 865 ms
48,208 KB |
testcase_12 | AC | 855 ms
47,320 KB |
testcase_13 | AC | 1,212 ms
65,164 KB |
testcase_14 | AC | 1,313 ms
65,596 KB |
testcase_15 | AC | 1,147 ms
64,260 KB |
testcase_16 | AC | 1,248 ms
64,132 KB |
testcase_17 | AC | 1,197 ms
64,788 KB |
testcase_18 | AC | 3 ms
5,376 KB |
testcase_19 | AC | 4 ms
5,376 KB |
testcase_20 | AC | 4 ms
5,376 KB |
testcase_21 | AC | 4 ms
5,376 KB |
testcase_22 | AC | 1,143 ms
64,008 KB |
testcase_23 | AC | 836 ms
55,072 KB |
testcase_24 | AC | 1,275 ms
64,700 KB |
testcase_25 | AC | 1,112 ms
55,584 KB |
testcase_26 | AC | 1,144 ms
55,884 KB |
testcase_27 | AC | 1 ms
5,376 KB |
testcase_28 | AC | 1 ms
5,376 KB |
testcase_29 | AC | 2 ms
5,376 KB |
testcase_30 | AC | 1 ms
5,376 KB |
testcase_31 | AC | 3 ms
5,376 KB |
testcase_32 | AC | 3 ms
5,376 KB |
testcase_33 | AC | 1 ms
5,376 KB |
testcase_34 | AC | 3 ms
5,376 KB |
testcase_35 | AC | 2 ms
5,376 KB |
testcase_36 | AC | 1 ms
5,376 KB |
testcase_37 | AC | 1 ms
5,376 KB |
testcase_38 | AC | 637 ms
43,916 KB |
testcase_39 | TLE | - |
testcase_40 | AC | 903 ms
55,060 KB |
testcase_41 | AC | 1,652 ms
62,732 KB |
testcase_42 | AC | 1,622 ms
62,740 KB |
testcase_43 | AC | 1,626 ms
62,616 KB |
testcase_44 | AC | 1,714 ms
62,608 KB |
ソースコード
local mfl, mce = math.floor, math.ceil local mmi, mma = math.min, math.max local bls, brs = bit.lshift, bit.rshift local ffi = require("ffi") local C = ffi.C local function getgcd(x, y) while 0LL < x do x, y = y % x, x end return y end 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 = {} self.stage[1] = ffi.new("int64_t[?]", 2) while mul < n do mul, stagenum = mul * 2, stagenum + 1 self.stage[stagenum] = ffi.new("int64_t[?]", mul + 1) end self.stagenum = stagenum -- for i = 1, mul do self.stage[stagenum][i] = emptyvalue end end SegTree.setSilent = function(self, idx, value) self.stage[self.stagenum][idx] = value end SegTree.right_bound = function(self, left, right) local ret, retpos = self.emptyvalue, left - 1 local stage, l, r = 1, left, right local stagenum = self.stagenum while true do local sz = bls(1, stagenum - stage) while (l - 1) % sz ~= 0 or r + 1 - l < sz do stage = stage + 1 sz = bls(1, stagenum - stage) end local tmp = self.func(ret, self.stage[stage][mce(l / sz)]) if 1LL < tmp then ret, retpos = tmp, l + sz - 1 if retpos == right then break end if l + sz <= r then stage, l, r = 1, l + sz, r else break end else if sz ~= 1 then stage, l, r = stage + 1, l, l + sz - 2 else break end end end return retpos + 1 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", "*l") local st = SegTree.new(n, getgcd, 0LL) ffi.cdef[[ long long atoll(const char*); ]] local s = io.read() do local i = 1 for w in s:gmatch("%d+") do st.stage[st.stagenum][i] = C.atoll(w) i = i + 1 end end st:updateAll() local ret = 0 local z = n for i = n, 1, -1 do local p = st:right_bound(i, z) ret = ret + n + 1 - p z = mmi(p, n) end print(ret) -- print(os.clock())