結果

問題 No.1065 電柱 / Pole (Easy)
ユーザー 👑 obakyanobakyan
提出日時 2020-05-29 22:05:33
言語 Lua
(LuaJit 2.1.1734355927)
結果
AC  
実行時間 801 ms / 2,000 ms
コード長 2,176 bytes
コンパイル時間 196 ms
コンパイル使用メモリ 6,948 KB
実行使用メモリ 44,928 KB
最終ジャッジ日時 2024-11-06 04:53:47
合計ジャッジ時間 12,407 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff # 

local msq = math.sqrt
-- use a 1D Seg class ( stage[], not stage[][])
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 = {}
  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)
  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])
    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 x, y = io.read("*n", "*n")
local p, q = {}, {}
local edge = {}
for i = 1, n do
  p[i], q[i] = io.read("*n", "*n")
  edge[i] = {}
end
for i = 1, m do
  local a, b = io.read("*n", "*n")
  local len = msq((p[a] - p[b]) * (p[a] - p[b]) + (q[a] - q[b]) * (q[a] - q[b]))
  edge[a][b], edge[b][a] = len, len
end

local inf = 10^18
local len = {}
local asked = {}
for i = 1, n do
  len[i] = inf
  asked[i] = false
end
len[x] = 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]
  asked[src] = true
  st:update(src)
  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[y])
0