結果

問題 No.1330 Multiply or Divide
ユーザー 👑 obakyanobakyan
提出日時 2022-05-05 17:49:18
言語 Lua
(LuaJit 2.1.1696795921)
結果
WA  
実行時間 -
コード長 2,970 bytes
コンパイル時間 66 ms
コンパイル使用メモリ 6,944 KB
実行使用メモリ 41,016 KB
最終ジャッジ日時 2024-07-04 19:20:04
合計ジャッジ時間 4,662 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 362 ms
41,004 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 38 ms
5,376 KB
testcase_07 WA -
testcase_08 AC 388 ms
41,008 KB
testcase_09 AC 393 ms
41,012 KB
testcase_10 AC 382 ms
40,996 KB
testcase_11 AC 371 ms
41,008 KB
testcase_12 AC 374 ms
41,016 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 2 ms
5,376 KB
testcase_17 WA -
testcase_18 AC 48 ms
5,376 KB
testcase_19 AC 45 ms
5,376 KB
testcase_20 AC 46 ms
5,376 KB
testcase_21 AC 45 ms
5,376 KB
testcase_22 AC 47 ms
5,376 KB
testcase_23 AC 50 ms
5,376 KB
testcase_24 AC 1 ms
5,376 KB
testcase_25 AC 1 ms
5,376 KB
testcase_26 AC 1 ms
5,376 KB
testcase_27 AC 1 ms
5,376 KB
testcase_28 AC 1 ms
5,376 KB
testcase_29 AC 1 ms
5,376 KB
testcase_30 AC 2 ms
5,376 KB
testcase_31 AC 1 ms
5,376 KB
testcase_32 AC 2 ms
5,376 KB
testcase_33 AC 2 ms
5,376 KB
testcase_34 AC 36 ms
5,376 KB
testcase_35 AC 11 ms
5,376 KB
testcase_36 AC 31 ms
5,376 KB
testcase_37 AC 27 ms
5,376 KB
testcase_38 AC 18 ms
5,376 KB
testcase_39 AC 13 ms
5,376 KB
testcase_40 AC 16 ms
5,376 KB
testcase_41 AC 8 ms
5,376 KB
testcase_42 AC 26 ms
5,376 KB
testcase_43 AC 29 ms
5,376 KB
testcase_44 WA -
testcase_45 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

local mmi, mma = math.min, math.max
local mfl, mce = math.floor, math.ceil
local bls, brs = bit.lshift, bit.rshift
local Heapq = {}
Heapq.create = function(self, lt)
  self.lt = lt
  self.cnt = 0
  self.t = {}
end

Heapq.empty = function(self)
  return self.cnt == 0
end

Heapq.push = function(self, v)
  local hqlt = self.lt
  local hqt = self.t
  local c = self.cnt + 1
  self.cnt = c
  hqt[c] = v
  while 1 < c do
    local p = brs(c, 1)
    if hqlt(hqt[c], hqt[p]) then
      hqt[c], hqt[p] = hqt[p], hqt[c]
      c = p
    else
      break
    end
  end
end

Heapq.pop = function(self)
  local hqlt = self.lt
  local hqt = self.t
  local ret = hqt[1]
  local c = self.cnt
  hqt[1] = hqt[c]
  c = c - 1
  self.cnt = c
  local p = 1
  while true do
    local d1, d2 = p * 2, p * 2 + 1
    if c < d1 then break
    elseif c < d2 then
      if hqlt(hqt[d1], hqt[p]) then
        hqt[d1], hqt[p] = hqt[p], hqt[d1]
      end
      break
    else
      if hqlt(hqt[d1], hqt[d2]) then
        if hqlt(hqt[d1], hqt[p]) then
          hqt[d1], hqt[p] = hqt[p], hqt[d1]
          p = d1
        else break
        end
      else
        if hqlt(hqt[d2], hqt[p]) then
          hqt[d2], hqt[p] = hqt[p], hqt[d2]
          p = d2
        else break
        end
      end
    end
  end
  return ret
end

Heapq.new = function(lt)
  local obj = {}
  setmetatable(obj, {__index = Heapq})
  obj:create(lt)
  return obj
end

local n, m, p = io.read("*n", "*n", "*n")
local a = {}
local amax = 0
for i = 1, n do
  a[i] = io.read("*n")
  amax = mma(amax, a[i])
end
if m < amax then print(1) os.exit() end
local c = {}
for i = 1, n do
  local ci = 1
  local ai = a[i]
  while ai % p == 0 do
    ci = ci + 1
    ai = mfl(ai / p)
  end
  if 1 < ai then
    if c[ai] then
      c[ai] = mmi(c[ai], ci)
    else
      c[ai] = ci
    end
  end
end
if not next(c) then print(-1) os.exit() end
local cm = {}
for k, v in pairs(c) do
  table.insert(cm, {k, v})
end
table.sort(cm, function(a, b) return a[1] < b[1] end)
local cn = #cm
cm[cn][3] = cm[cn][2]
for i = cn - 1, 1, -1 do
  cm[i][3] = mmi(cm[i][2], cm[i + 1][3])
end
local lim = mfl(m / amax) + 1
local val, score, valmap = {}, {}, {}
valmap[lim] = 1
val[1] = lim
score[1] = 1
local hq = Heapq.new(function(a, b) return val[a] > val[b] end)
hq:push(1)
local ret = 1000000007
while not hq:empty() do
  local idx = hq:pop()
  local v, s = val[idx], score[idx]
  if v < amax then
    ret = mmi(ret, s + 1)
  else
    for i = 1, cn do
      local div = cm[i][1]
      local cost = cm[i][2]
      if v < div then
        local mincost = cm[i][3]
        ret = mmi(ret, s + mincost)
        break
      else
        local dst = mfl(v / div)
        local dstidx = valmap[dst]
        if dstidx then
          score[dstidx] = mmi(score[dstidx], s + cost)
        else
          table.insert(val, dst)
          table.insert(score, s + cost)
          valmap[dst] = #val
          hq:push(#val)
        end
      end
    end
  end
end
print(ret)
0