結果

問題 No.1283 Extra Fee
コンテスト
ユーザー obakyan
提出日時 2021-08-10 19:13:47
言語 Lua
(LuaJit 2.1.1734355927)
結果
AC  
実行時間 822 ms / 2,000 ms
コード長 2,886 bytes
コンパイル時間 44 ms
コンパイル使用メモリ 6,944 KB
実行使用メモリ 21,376 KB
最終ジャッジ日時 2024-11-16 08:32:10
合計ジャッジ時間 11,246 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

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 sz, m = io.read("*n", "*n")
local t = {}
for i = 1, sz * sz do t[i] = 0 end
for i = 1, m do
  local a, b, c = io.read("*n", "*n", "*n")
  t[(a - 1) * sz + b] = c
end
local n = sz * sz * 2


local inf = 1000000007 * 2000
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)

local function walk(curcost, dst)
  if dst <= sz * sz then
    if curcost + 1 + t[dst] < len[dst] then
      len[dst] = curcost + 1 + t[dst]
      st:update(dst)
    end
    if curcost + 1 < len[dst + sz * sz] then
      len[dst + sz * sz] = curcost + 1
      st:update(dst + sz * sz)
    end
  else
    if curcost + 1 + t[dst - sz * sz] < len[dst] then
      len[dst] = curcost + 1 + t[dst - sz * sz]
      st:update(dst)
    end
  end
end

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 rawsrc = src
  local front = src <= sz * sz
  if not front then
    rawsrc = rawsrc - sz * sz
  end
  local row = mce(rawsrc / sz)
  local col = rawsrc - (row - 1) * sz
  local curlen = len[src]
  if 1 < row then walk(curlen, src - sz) end
  if row < sz then walk(curlen, src + sz) end
  if 1 < col then walk(curlen, src - 1) end
  if col < sz then walk(curlen, src + 1) end
end

print(len[n])
-- test: https://yukicoder.me/problems/no/1065
0