結果

問題 No.376 立方体のN等分 (2)
ユーザー 👑 obakyanobakyan
提出日時 2019-05-06 23:51:24
言語 Lua
(LuaJit 2.1.1696795921)
結果
AC  
実行時間 3,253 ms / 5,000 ms
コード長 2,251 bytes
コンパイル時間 149 ms
コンパイル使用メモリ 5,284 KB
実行使用メモリ 143,188 KB
最終ジャッジ日時 2023-09-10 23:44:58
合計ジャッジ時間 28,161 ms
ジャッジサーバーID
(参考情報)
judge14 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 375 ms
75,936 KB
testcase_03 AC 366 ms
76,024 KB
testcase_04 AC 449 ms
141,480 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 1 ms
4,380 KB
testcase_08 AC 13 ms
6,708 KB
testcase_09 AC 60 ms
20,616 KB
testcase_10 AC 258 ms
37,196 KB
testcase_11 AC 198 ms
71,832 KB
testcase_12 AC 257 ms
71,888 KB
testcase_13 AC 270 ms
71,756 KB
testcase_14 AC 295 ms
71,852 KB
testcase_15 AC 334 ms
71,728 KB
testcase_16 AC 2,832 ms
76,128 KB
testcase_17 AC 373 ms
75,984 KB
testcase_18 AC 411 ms
141,364 KB
testcase_19 AC 419 ms
141,672 KB
testcase_20 AC 431 ms
143,188 KB
testcase_21 AC 3,018 ms
141,692 KB
testcase_22 AC 419 ms
141,484 KB
testcase_23 AC 3,069 ms
141,532 KB
testcase_24 AC 2,666 ms
141,792 KB
testcase_25 AC 437 ms
141,464 KB
testcase_26 AC 3,253 ms
141,688 KB
testcase_27 AC 448 ms
141,528 KB
testcase_28 AC 420 ms
141,544 KB
testcase_29 AC 441 ms
141,480 KB
testcase_30 AC 446 ms
141,324 KB
testcase_31 AC 440 ms
141,640 KB
testcase_32 AC 454 ms
141,296 KB
testcase_33 AC 454 ms
141,364 KB
testcase_34 AC 449 ms
141,484 KB
testcase_35 AC 440 ms
141,472 KB
testcase_36 AC 450 ms
141,452 KB
testcase_37 AC 448 ms
141,540 KB
testcase_38 AC 447 ms
141,604 KB
testcase_39 AC 448 ms
141,460 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

local n = io.read("*n")
local mce, mfl, msq, mmi = math.ceil, math.floor, math.sqrt, math.min

local function getprimes(x)
  local primes = {}
  local allnums = {}
  for i = 1, x do allnums[i] = true end
  for i = 2, x do
    if(allnums[i]) then
      table.insert(primes, i)
      local lim = mfl(x / i)
      for j = 2, lim do
        allnums[j * i] = false
      end
    end
  end
  return primes
end

local function getdivisorparts(x, primes)
  local prime_num = #primes
  local tmp = {}
  local lim = mce(msq(x))
  local primepos = 1
  local dv = primes[primepos]
  while(primepos <= prime_num and dv <= lim) do
    if(x % dv == 0) then
      local asdf = {}
      asdf.p = dv
      asdf.cnt = 1
      x = x / dv
      while(x % dv == 0) do
        x = x / dv
        asdf.cnt = asdf.cnt + 1
      end
      table.insert(tmp, asdf)
      lim = mce(msq(x))
    end
    if(primepos == prime_num) then break end
    primepos = primepos + 1
    dv = primes[primepos]
  end
  if(x ~= 1) then
    local asdf = {}
    asdf.p, asdf.cnt = x, 1
    table.insert(tmp, asdf)
  end
  return tmp
end

local function getdivisor(divisorparts)
  local t = {}
  local pat = 1
  local len = #divisorparts
  local allpat = 1
  for i = 1, len do
    allpat = allpat * (divisorparts[i].cnt + 1)
  end
  for t_i_pat = 0, allpat - 1 do
    local div = allpat
    local i_pat = t_i_pat
    local ret = 1
    for i = 1, len do
      div = mfl(div / (divisorparts[i].cnt + 1))
      local mul = mfl(i_pat / div)
      i_pat = i_pat % div
      for j = 1, mul do ret = ret * divisorparts[i].p end
    end
    table.insert(t, ret)
  end
  table.sort(t)
  return t
end
local retmin, retmax = n - 1, n - 1
local primes = getprimes(mce(msq(n)))
local divisorparts = getdivisorparts(n, primes)
local divisor = getdivisor(divisorparts)
local dmax = mce(n^(1/3))
for i = 1, #divisor do
  if(dmax < divisor[i]) then break end
  local rem = mfl(n / divisor[i])
  local remparts = getdivisorparts(rem, primes)
  local remdiv = getdivisor(remparts)
  local remlim = mce(msq(rem))
  for j = 1, #remdiv do
    if(remlim < remdiv[j]) then break end
    local last = mfl(rem / remdiv[j])
    retmin = mmi(retmin, divisor[i] + remdiv[j] + last - 3)
  end
end
print(retmin .. " " .. retmax)
0