#895050 (Lua) No.2387 Yokan Factory

• 問題: No.2387 Yokan Factory
• ユーザー: 👑 obakyan
• 提出日時: 2023-07-24 22:55:07
• 言語: Lua (LuaJit 2.1.1734355927)
• 結果: AC
• 実行時間: 1,837 ms / 5,000 ms
• コード長: 2,776 bytes
• コンパイル時間: 309 ms
• コンパイル使用メモリ: 5,120 KB
• 実行使用メモリ: 16,896 KB
• 最終ジャッジ日時: 2024-10-01 18:39:17
• 合計ジャッジ時間: 15,828 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 35

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
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, x = io.read("*n", "*n", "*n")
local a, b, c, d = {}, {}, {}, {}
local edge = {}
for i = 1, n do
  edge[i] = {}
end
for i = 1, m do
  a[i], b[i], c[i], d[i] = io.read("*n", "*n", "*n", "*n")
  table.insert(edge[a[i]], i)
  table.insert(edge[b[i]], i)
end
local inf = 1000000007 * 100001
x = mmi(x, inf - 1)
local len = {}
local asked = {}
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
for i = 1, n do
  len[i] = inf
  asked[i] = false
end
len[1] = 0
asked[n + 1] = true
local st = SegTree.new(n, mergefunc, n + 1)
local function solve(limit)
  for i = 1, n do
    len[i] = inf
    asked[i] = false
  end
  len[1] = 0
  asked[n + 1] = true
  st:updateAll()
  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)
    for j = 1, #edge[src] do
      local ei = edge[src][j]
      if limit <= d[ei] then
        local dst = a[ei] + b[ei] - src
        local cost = c[ei]
        if len[src] + cost < len[dst] then
          len[dst] = len[src] + cost
          st:update(dst)
        end
      end
    end
  end
  return len[n] < inf and len[n] <= x
end
local ok, ng = 0, 1000000001
while 1 < ng - ok do
  local mid = mfl((ng + ok) / 2)
  if solve(mid) then
    ok = mid
  else
    ng = mid
  end
end
if ok == 0 then
  print(-1)
else
  print(ok)
end
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX