結果
問題 | No.376 立方体のN等分 (2) |
ユーザー | 👑 obakyan |
提出日時 | 2019-05-09 08:53:49 |
言語 | Lua (LuaJit 2.1.1696795921) |
結果 |
AC
|
実行時間 | 2,907 ms / 5,000 ms |
コード長 | 2,913 bytes |
コンパイル時間 | 52 ms |
コンパイル使用メモリ | 5,216 KB |
実行使用メモリ | 142,692 KB |
最終ジャッジ日時 | 2023-09-14 17:39:18 |
合計ジャッジ時間 | 27,155 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 387 ms
75,984 KB |
testcase_03 | AC | 378 ms
75,888 KB |
testcase_04 | AC | 480 ms
141,652 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 12 ms
6,704 KB |
testcase_09 | AC | 67 ms
20,520 KB |
testcase_10 | AC | 254 ms
36,912 KB |
testcase_11 | AC | 192 ms
71,768 KB |
testcase_12 | AC | 268 ms
71,672 KB |
testcase_13 | AC | 274 ms
71,672 KB |
testcase_14 | AC | 319 ms
71,816 KB |
testcase_15 | AC | 344 ms
71,936 KB |
testcase_16 | AC | 2,452 ms
76,004 KB |
testcase_17 | AC | 388 ms
75,824 KB |
testcase_18 | AC | 436 ms
141,476 KB |
testcase_19 | AC | 442 ms
141,412 KB |
testcase_20 | AC | 443 ms
142,692 KB |
testcase_21 | AC | 2,706 ms
141,460 KB |
testcase_22 | AC | 469 ms
141,404 KB |
testcase_23 | AC | 2,746 ms
141,492 KB |
testcase_24 | AC | 2,440 ms
141,756 KB |
testcase_25 | AC | 484 ms
141,596 KB |
testcase_26 | AC | 2,907 ms
141,680 KB |
testcase_27 | AC | 493 ms
141,296 KB |
testcase_28 | AC | 490 ms
141,336 KB |
testcase_29 | AC | 491 ms
141,524 KB |
testcase_30 | AC | 491 ms
141,304 KB |
testcase_31 | AC | 492 ms
141,356 KB |
testcase_32 | AC | 497 ms
141,504 KB |
testcase_33 | AC | 493 ms
141,540 KB |
testcase_34 | AC | 492 ms
141,616 KB |
testcase_35 | AC | 489 ms
141,396 KB |
testcase_36 | AC | 487 ms
141,444 KB |
testcase_37 | AC | 492 ms
141,508 KB |
testcase_38 | AC | 502 ms
141,300 KB |
testcase_39 | AC | 490 ms
141,924 KB |
ソースコード
local n = io.read("*n") local mce, mfl, msq, mmi = math.ceil, math.floor, math.sqrt, math.min local tbli = table.insert 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 tbli(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 tbli(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 tbli(tmp, asdf) end return tmp end local function getdivisor(divisorparts, minlim) 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 if minlim == nil or minlim <= ret then tbli(t, ret) end 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 divpart = getdivisorparts(divisor[i], primes) local remparts = {} local k = 1 for j = 1, #divpart do while(k <= #divisorparts) do local tmp = {} tmp.p = divisorparts[k].p if divpart[j].p == divisorparts[k].p then tmp.cnt = divisorparts[k].cnt - divpart[j].cnt tbli(remparts, tmp) k = k + 1 break else tmp.cnt = divisorparts[k].cnt tbli(remparts, tmp) k = k + 1 end end end while(k <= #divisorparts) do local tmp = {} tmp.p = divisorparts[k].p tmp.cnt = divisorparts[k].cnt tbli(remparts, tmp) k = k + 1 end local rem = mfl(n / divisor[i]) local remdiv = getdivisor(remparts, divisor[i]) 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)