結果

問題 No.1036 Make One With GCD 2
ユーザー 👑 obakyan
提出日時 2020-04-25 10:50:19
言語 Lua
(LuaJit 2.1.1734355927)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,703 bytes
コンパイル時間 247 ms
コンパイル使用メモリ 6,820 KB
実行使用メモリ 84,828 KB
最終ジャッジ日時 2024-11-07 04:08:34
合計ジャッジ時間 34,534 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 40 TLE * 1
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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)
local child = self.stage[i + 1]
local parent = self.stage[i]
for j = 1, cnt do
parent[j] = self.func(child[j * 2 - 1], child[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
self.spos = {}
for i = 1, n do
local sp, sz = 1, bls(1, stagenum - 1)
while(i - 1) % sz ~= 0 do
sp = sp + 1
sz = brs(sz, 1)
end
self.spos[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
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 l, r = left, right
local stage = mma(self.spos[left], self.sz_stage[right - left + 1])
local stagenum = self.stagenum
while true do
local sz = bls(1, stagenum - stage)
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
l, r = l + sz, r
stage = mma(self.spos[l], self.sz_stage[r - l + 1])
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
-- print(os.clock())
st:updateAll()
-- print(os.clock())
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())
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0