結果

問題 No.1449 新プロランド
ユーザー 👑 obakyan
提出日時 2021-08-10 22:39:29
言語 Lua
(LuaJit 2.1.1734355927)
結果
AC  
実行時間 402 ms / 2,000 ms
コード長 2,526 bytes
コンパイル時間 136 ms
コンパイル使用メモリ 6,816 KB
実行使用メモリ 35,712 KB
最終ジャッジ日時 2024-12-24 02:08:39
合計ジャッジ時間 3,883 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff # 

local mfl, mce = math.floor, math.ceil
local mmi, mma = math.min, math.max
local pow2 = {1}
for i = 2, 28 do pow2[i] = pow2[i - 1] * 2 end
local SegTree = {}
SegTree.updateAll = function(self)
  for i = self.stagenum - 1, 1, -1 do
    local cnt = pow2[i]
    for j = 0, cnt - 1 do
      self.stage[cnt + j] = self.func(self.stage[(cnt + j) * 2], self.stage[(cnt + j) * 2 + 1])
    end
  end
end
SegTree.create = function(self, n, func, emptyvalue)
  self.func, self.emptyvalue = func, emptyvalue
  local stagenum, mul = 1, 1
  self.stage = {} -- use 1D Tree (stage[], not stage[][])
  while mul < n do
    mul, stagenum = mul * 2, stagenum + 1
  end
  self.stagenum = stagenum
  for i = 1, mul * 2 - 1 do self.stage[i] = emptyvalue end
  for i = 1, n do self.stage[mul + i - 1] = i end
  self:updateAll()
end
SegTree.update = function(self, idx, force)
  idx = idx + pow2[self.stagenum] - 1
  for i = self.stagenum - 1, 1, -1 do
    local dst = mfl(idx / 2)
    local rem = dst * 4 + 1 - idx
    self.stage[dst] = self.func(self.stage[idx], self.stage[rem])
    if not force and self.stage[dst] ~= self.stage[idx] then break end
    idx = dst
  end
end
SegTree.new = function(n, func, emptyvalue)
  local obj = {}
  setmetatable(obj, {__index = SegTree})
  obj:create(n, func, emptyvalue)
  return obj
end

local rn, m = io.read("*n", "*n")
local edge = {}
for i = 1, rn do
  edge[i] = {}
end
for i = 1, m do
  local a, b, c = io.read("*n", "*n", "*n")
  edge[a][b], edge[b][a] = c, c
end
local d = {}
for i = 1, rn do
  d[i] = io.read("*n")
end
local lim = (rn - 1) * 100 + 1
local n = lim * rn

local inf = 1000000007
local len = {}
local asked = {}
for i = 1, n do
  len[i] = inf
  asked[i] = false
end
len[1] = 0
asked[n + 1] = true

local function mergefunc(x, y)
  if asked[x] then return y
  elseif asked[y] then return x
  else
    return len[x] < len[y] and x or y
  end
end

local st = SegTree.new(n, mergefunc, n + 1)

for i = 1, n do
  local src = st.stage[1]
  if asked[src] then break end
  if inf <= len[src] then break end
  asked[src] = true
  st:update(src, true)
  local w = mce(src / rn)
  local rawsrc = src - (w - 1) * rn
  local nxtlen = len[src] + d[rawsrc]
  w = w + d[rawsrc]
  for rawdst, c in pairs(edge[rawsrc]) do
    local dstlen = nxtlen + mfl(c / (w - 1))
    local dst = (w - 1) * rn + rawdst
    if dst <= n and dstlen < len[dst] then
      len[dst] = dstlen
      st:update(dst)
    end
  end
end
local ret = len[n]
for i = 1, lim do
  ret = mmi(ret, len[(i - 1) * rn + rn])
end
print(ret)
0