結果

問題 No.1036 Make One With GCD 2
ユーザー 👑 obakyanobakyan
提出日時 2020-04-30 13:32:27
言語 Lua
(LuaJit 2.1.1696795921)
結果
TLE  
実行時間 -
コード長 3,352 bytes
コンパイル時間 86 ms
コンパイル使用メモリ 5,000 KB
実行使用メモリ 141,112 KB
最終ジャッジ日時 2023-08-21 17:22:04
合計ジャッジ時間 39,062 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,449 ms
135,300 KB
testcase_01 AC 504 ms
95,752 KB
testcase_02 AC 306 ms
52,200 KB
testcase_03 AC 87 ms
16,956 KB
testcase_04 AC 155 ms
30,008 KB
testcase_05 AC 2 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 240 ms
45,148 KB
testcase_08 AC 202 ms
37,124 KB
testcase_09 AC 1,517 ms
94,420 KB
testcase_10 AC 1,339 ms
93,084 KB
testcase_11 AC 1,508 ms
94,764 KB
testcase_12 AC 1,366 ms
93,356 KB
testcase_13 AC 1,991 ms
124,640 KB
testcase_14 TLE -
testcase_15 AC 1,850 ms
122,840 KB
testcase_16 AC 1,964 ms
122,988 KB
testcase_17 AC 1,992 ms
124,156 KB
testcase_18 AC 3 ms
4,376 KB
testcase_19 AC 4 ms
4,376 KB
testcase_20 AC 6 ms
4,380 KB
testcase_21 AC 5 ms
4,376 KB
testcase_22 AC 1,953 ms
122,412 KB
testcase_23 AC 1,469 ms
99,764 KB
testcase_24 AC 1,962 ms
123,744 KB
testcase_25 AC 1,824 ms
106,588 KB
testcase_26 AC 1,933 ms
107,468 KB
testcase_27 AC 1 ms
4,376 KB
testcase_28 AC 1 ms
4,376 KB
testcase_29 AC 1 ms
4,376 KB
testcase_30 AC 1 ms
4,376 KB
testcase_31 AC 2 ms
4,376 KB
testcase_32 AC 2 ms
4,376 KB
testcase_33 AC 1 ms
4,380 KB
testcase_34 AC 2 ms
4,380 KB
testcase_35 AC 1 ms
4,376 KB
testcase_36 AC 1 ms
4,380 KB
testcase_37 AC 1 ms
4,380 KB
testcase_38 AC 304 ms
51,600 KB
testcase_39 TLE -
testcase_40 AC 1,535 ms
99,812 KB
testcase_41 AC 1,918 ms
136,804 KB
testcase_42 AC 1,775 ms
136,764 KB
testcase_43 AC 1,609 ms
136,712 KB
testcase_44 AC 1,808 ms
136,808 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)
  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.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)
  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 + 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())
local ret = 0
if true then
  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)
else
  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)
end
-- print(os.clock())
0