結果

問題 No.1995 CHIKA Road
コンテスト
ユーザー 👑 obakyan
提出日時 2022-07-02 01:01:04
言語 Lua
(LuaJit 2.1.1734355927)
結果
WA  
実行時間 -
コード長 2,528 bytes
コンパイル時間 226 ms
コンパイル使用メモリ 5,376 KB
実行使用メモリ 48,220 KB
最終ジャッジ日時 2024-11-26 09:22:17
合計ジャッジ時間 7,421 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 31 WA * 6
権限があれば一括ダウンロードができます

ソースコード

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 n, m = io.read("*n", "*n")
local tm = {}
local a, b = {}, {}
for i = 1, m do
  a[i], b[i] = io.read("*n", "*n")
  tm[a[i]], tm[b[i]] = true, true
end
tm[n] = true
local tuniq = {}
for k, v in pairs(tm) do
  table.insert(tuniq, k)
end
table.sort(tuniq)
local tn = #tuniq
for i = 1, tn do
  tm[tuniq[i]] = i
end

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

for i = 1, tn - 1 do
  local x, y = tuniq[i], tuniq[i + 1]
  edge[i][i + 1] = (y - x) * 2
end
for i = 1, m do
  local ai, bi = a[i], b[i]
  local ap, bp = tm[ai], tm[bi]
  edge[ap][bp] = (bi - ai) * 2 - 1  
end

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(tn, mergefunc, tn + 1)

for i = 1, tn 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)
  for dst, cost in pairs(edge[src]) do
    if len[src] + cost < len[dst] then
      len[dst] = len[src] + cost
      st:update(dst)
    end
  end
end

print(len[tn])
0