結果

問題 No.1036 Make One With GCD 2
ユーザー 👑 obakyanobakyan
提出日時 2020-04-30 20:45:31
言語 Lua
(LuaJit 2.1.1696795921)
結果
TLE  
実行時間 -
コード長 3,996 bytes
コンパイル時間 443 ms
コンパイル使用メモリ 5,376 KB
実行使用メモリ 84,776 KB
最終ジャッジ日時 2024-05-09 22:05:34
合計ジャッジ時間 46,803 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,524 ms
80,592 KB
testcase_01 AC 399 ms
62,468 KB
testcase_02 AC 613 ms
68,260 KB
testcase_03 AC 49 ms
11,648 KB
testcase_04 AC 85 ms
20,352 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 1 ms
5,376 KB
testcase_07 AC 143 ms
31,064 KB
testcase_08 AC 128 ms
27,856 KB
testcase_09 AC 1,573 ms
70,248 KB
testcase_10 AC 1,340 ms
69,548 KB
testcase_11 AC 1,318 ms
70,444 KB
testcase_12 AC 1,361 ms
69,696 KB
testcase_13 TLE -
testcase_14 TLE -
testcase_15 TLE -
testcase_16 TLE -
testcase_17 TLE -
testcase_18 AC 4 ms
5,376 KB
testcase_19 AC 4 ms
5,376 KB
testcase_20 AC 5 ms
5,376 KB
testcase_21 AC 5 ms
5,376 KB
testcase_22 TLE -
testcase_23 AC 1,766 ms
74,248 KB
testcase_24 TLE -
testcase_25 AC 1,857 ms
78,480 KB
testcase_26 TLE -
testcase_27 AC 1 ms
5,376 KB
testcase_28 AC 2 ms
5,376 KB
testcase_29 AC 1 ms
5,376 KB
testcase_30 AC 1 ms
5,376 KB
testcase_31 AC 2 ms
5,376 KB
testcase_32 AC 3 ms
5,376 KB
testcase_33 AC 1 ms
5,376 KB
testcase_34 AC 2 ms
5,376 KB
testcase_35 AC 1 ms
5,376 KB
testcase_36 AC 1 ms
5,376 KB
testcase_37 AC 1 ms
5,376 KB
testcase_38 AC 1,418 ms
67,772 KB
testcase_39 AC 1,714 ms
81,724 KB
testcase_40 AC 1,455 ms
74,240 KB
testcase_41 AC 1,127 ms
81,724 KB
testcase_42 AC 1,463 ms
81,720 KB
testcase_43 AC 964 ms
81,724 KB
testcase_44 AC 1,724 ms
81,724 KB
権限があれば一括ダウンロードができます

ソースコード

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)
  if x == 0LL then return y end
  if y == 0LL then return x end
  local mul = 1LL
  while x % 2LL == 0LL and y % 2LL == 0LL do
    mul = mul * 2LL
    x, y = x / 2LL, y / 2LL
  end
  while 0LL < x do
    while x % 2LL == 0LL do x = x / 2LL end
    x, y = y % x, x
  end
  return y * mul
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.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.spos[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.right_bound = function(self, left, right, v)
  local ret, retpos = self.emptyvalue, left - 1
  if v then ret = v end
  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 + 1, getgcd, 0LL)
ffi.cdef[[
long long atoll(const char*);
]]

local s = io.read()
local sts = st.stage[st.stagenum]
do
  local i = 1
  for w in s:gmatch("%d+") do
    sts[i] = C.atoll(w)
    i = i + 1
  end
  sts[n + 1] = 1LL
end
-- print(os.clock())

st:updateAll()
-- print(os.clock())
do
  local ret = 0
  local z = 1
  for i = 1, n do
    if z <= n then
      local v = st:getRange(i, z)
      if v ~= 1LL then
        if z == n then
          z = n + 1
        else
          z = st:right_bound(z + 1, n, v)
        end
      end
    end
    ret = ret + n + 1 - z
  end
  print(ret)
  -- print(os.clock())
end
if false then--do
  local ret = 0
  local z = 1
  for i = 1, n do
    local v = st:getRange(i, z)
    while v ~= 1LL and z <= n do
      z = z + 1
      v = getgcd(v, sts[z])
    end
    ret = ret + n + 1 - z
    if z == n + 1 then break end
  end
  print(ret)
  print(os.clock())
end
if false then--do
  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())
end
0