結果
問題 | No.1059 素敵な集合 |
ユーザー | 👑 obakyan |
提出日時 | 2020-05-22 22:23:31 |
言語 | Lua (LuaJit 2.1.1696795921) |
結果 |
AC
|
実行時間 | 1,035 ms / 2,000 ms |
コード長 | 2,607 bytes |
コンパイル時間 | 109 ms |
コンパイル使用メモリ | 5,212 KB |
実行使用メモリ | 11,064 KB |
最終ジャッジ日時 | 2023-09-30 15:30:37 |
合計ジャッジ時間 | 9,336 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1,035 ms
7,656 KB |
testcase_02 | AC | 336 ms
6,012 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 225 ms
4,504 KB |
testcase_07 | AC | 223 ms
5,124 KB |
testcase_08 | AC | 326 ms
5,752 KB |
testcase_09 | AC | 82 ms
4,380 KB |
testcase_10 | AC | 349 ms
5,592 KB |
testcase_11 | AC | 230 ms
4,512 KB |
testcase_12 | AC | 150 ms
4,860 KB |
testcase_13 | AC | 486 ms
5,960 KB |
testcase_14 | AC | 23 ms
4,376 KB |
testcase_15 | AC | 850 ms
8,964 KB |
testcase_16 | AC | 297 ms
6,396 KB |
testcase_17 | AC | 296 ms
5,596 KB |
testcase_18 | AC | 548 ms
11,064 KB |
testcase_19 | AC | 1,017 ms
8,136 KB |
testcase_20 | AC | 963 ms
8,644 KB |
testcase_21 | AC | 874 ms
8,744 KB |
ソースコード
local mce, mfl, msq, mmi, mma, mab = math.ceil, math.floor, math.sqrt, math.min, math.max, math.abs 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 t = {} t.p = dv t.cnt = 1 x = mfl(x / dv) while x % dv == 0 do x = mfl(x / dv) t.cnt = t.cnt + 1 end table.insert(tmp, t) lim = mce(msq(x)) end if primepos == prime_num then break end primepos = primepos + 1 dv = primes[primepos] end if x ~= 1 then local t = {} t.p, t.cnt = x, 1 table.insert(tmp, t) end return tmp end local function getdivisorCore(divisorparts) local t = {} local pat = 1 local len = #divisorparts local allpat = 1 for i = 1, len do allpat = allpat * (1 + divisorparts[i].cnt) 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 function getdivisor(x, primes) local dvp = getdivisorparts(x, primes) return getdivisorCore(dvp) end local l, r = io.read("*n", "*n") -- local l, r = 5000, 200000 local primes = getprimes(r) local parent = {} for i = l, r do parent[i] = i end local function uf_findroot(idx) local idx_update = idx while parent[idx] ~= idx do idx = parent[idx] end while parent[idx_update] ~= idx do parent[idx_update], idx_update = idx, parent[idx_update] end return idx end for i = r, l, -1 do local dv = getdivisor(i, primes) local j = 1 for k = 1, #dv do if l <= dv[k] then j = k break end end local dv1 = dv[j] local dv1p = uf_findroot(dv1) for k = j + 1, #dv do local dv2 = dv[k] local dv2p = uf_findroot(dv2) parent[dv2], parent[dv2p] = dv1p, dv1p end end local pmap, cnt = {}, 0 for i = l, r do local r = uf_findroot(i) if not pmap[r] then pmap[r] = true cnt = cnt + 1 end end print(cnt - 1)