結果

問題 No.1995 CHIKA Road
ユーザー 👑 obakyanobakyan
提出日時 2022-07-02 01:01:04
言語 Lua
(LuaJit 2.1.1696795921)
結果
WA  
実行時間 -
コード長 2,528 bytes
コンパイル時間 76 ms
コンパイル使用メモリ 5,372 KB
実行使用メモリ 41,536 KB
最終ジャッジ日時 2023-08-17 12:48:12
合計ジャッジ時間 9,430 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 WA -
testcase_06 AC 34 ms
4,864 KB
testcase_07 AC 116 ms
10,948 KB
testcase_08 AC 3 ms
4,380 KB
testcase_09 AC 4 ms
4,380 KB
testcase_10 AC 63 ms
6,120 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 56 ms
6,456 KB
testcase_17 AC 252 ms
19,604 KB
testcase_18 AC 426 ms
27,536 KB
testcase_19 AC 429 ms
27,744 KB
testcase_20 AC 223 ms
18,640 KB
testcase_21 AC 201 ms
14,940 KB
testcase_22 AC 412 ms
26,956 KB
testcase_23 AC 117 ms
11,092 KB
testcase_24 AC 359 ms
25,188 KB
testcase_25 AC 64 ms
7,116 KB
testcase_26 AC 143 ms
13,136 KB
testcase_27 AC 341 ms
24,840 KB
testcase_28 AC 206 ms
15,156 KB
testcase_29 AC 406 ms
27,240 KB
testcase_30 AC 62 ms
6,728 KB
testcase_31 AC 32 ms
4,584 KB
testcase_32 AC 85 ms
8,160 KB
testcase_33 AC 338 ms
24,668 KB
testcase_34 AC 35 ms
5,064 KB
testcase_35 AC 131 ms
11,472 KB
testcase_36 AC 154 ms
13,388 KB
testcase_37 AC 386 ms
26,164 KB
testcase_38 AC 265 ms
19,932 KB
testcase_39 AC 28 ms
4,524 KB
権限があれば一括ダウンロードができます

ソースコード

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