結果

問題 No.1030 だんしんぐぱーりない
ユーザー 👑 obakyanobakyan
提出日時 2021-08-13 09:22:21
言語 Lua
(LuaJit 2.1.1696795921)
結果
AC  
実行時間 405 ms / 2,000 ms
コード長 3,676 bytes
コンパイル時間 214 ms
コンパイル使用メモリ 6,692 KB
実行使用メモリ 37,248 KB
最終ジャッジ日時 2024-10-02 17:24:32
合計ジャッジ時間 12,273 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,820 KB
testcase_04 AC 2 ms
6,820 KB
testcase_05 AC 285 ms
31,232 KB
testcase_06 AC 246 ms
25,856 KB
testcase_07 AC 148 ms
13,696 KB
testcase_08 AC 169 ms
22,784 KB
testcase_09 AC 275 ms
35,712 KB
testcase_10 AC 107 ms
8,064 KB
testcase_11 AC 296 ms
23,552 KB
testcase_12 AC 280 ms
26,752 KB
testcase_13 AC 220 ms
29,312 KB
testcase_14 AC 282 ms
25,984 KB
testcase_15 AC 131 ms
12,416 KB
testcase_16 AC 254 ms
18,688 KB
testcase_17 AC 264 ms
31,872 KB
testcase_18 AC 299 ms
33,664 KB
testcase_19 AC 156 ms
11,264 KB
testcase_20 AC 194 ms
16,384 KB
testcase_21 AC 202 ms
21,376 KB
testcase_22 AC 189 ms
16,640 KB
testcase_23 AC 223 ms
19,072 KB
testcase_24 AC 173 ms
15,232 KB
testcase_25 AC 212 ms
23,424 KB
testcase_26 AC 130 ms
6,820 KB
testcase_27 AC 144 ms
8,192 KB
testcase_28 AC 271 ms
20,992 KB
testcase_29 AC 213 ms
27,008 KB
testcase_30 AC 176 ms
16,384 KB
testcase_31 AC 190 ms
17,152 KB
testcase_32 AC 259 ms
25,856 KB
testcase_33 AC 262 ms
30,464 KB
testcase_34 AC 104 ms
10,752 KB
testcase_35 AC 372 ms
37,120 KB
testcase_36 AC 393 ms
37,248 KB
testcase_37 AC 398 ms
37,120 KB
testcase_38 AC 405 ms
37,120 KB
testcase_39 AC 401 ms
36,992 KB
testcase_40 AC 2 ms
6,820 KB
testcase_41 AC 2 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

local mfl, mce = math.floor, math.ceil
local mmi, mma = math.min, math.max
local bls, brs = bit.lshift, bit.rshift
local SegTree = {}
SegTree.updateAll = function(self)
  for i = self.stagenum - 1, 1, -1 do
    local cnt = bls(1, i - 1)
    for j = 1, cnt do
      self.stage[i][j] = self.func(self.stage[i + 1][j * 2 - 1], self.stage[i + 1][j * 2])
    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
    self.stage[stagenum] = {}
  end
  self.stagenum = stagenum
  self.left_stage = {}
  for i = 1, n do
    local sp, sz = 1, bls(1, stagenum - 1)
    while(i - 1) % sz ~= 0 do
      sp, sz = sp + 1, brs(sz, 1)
    end
    self.left_stage[i] = sp
  end
  self.sz_stage = {}
  local tmp, sp = 1, stagenum
  for i = 1, n do
    if tmp * 2 == i then tmp, sp = tmp * 2, sp - 1 end
    self.sz_stage[i] = sp
  end
  for i = 1, mul do self.stage[stagenum][i] = emptyvalue end
  self:updateAll()
end
SegTree.getRange = function(self, left, right)
  if left == right then return self.stage[self.stagenum][left] end
  local stagenum = self.stagenum
  local ret = self.emptyvalue
  while left <= right do
    local stage = mma(self.left_stage[left], self.sz_stage[right - left + 1])
    local sz = bls(1, stagenum - stage)
    ret = self.func(ret, self.stage[stage][1 + brs(left - 1, stagenum - stage)])
    left = left + sz
  end
  return ret
end
SegTree.update = function(self, idx)
  for i = self.stagenum - 1, 1, -1 do
    local dst = brs(idx + 1, 1)
    local rem = dst * 4 - 1 - idx
    self.stage[i][dst] = self.func(self.stage[i + 1][idx], self.stage[i + 1][rem])
    idx = dst
  end
end
SegTree.setValue = function(self, idx, value, silent)
  self.stage[self.stagenum][idx] = value
  if not silent then
    self:update(idx)
  end
end
SegTree.new = function(n, func, emptyvalue)
  local obj = {}
  setmetatable(obj, {__index = SegTree})
  obj:create(n, func, emptyvalue)
  return obj
end

local n, k, q = io.read("*n", "*n", "*n")
local c = {}
for i = 1, n do
  c[i] = io.read("*n")
end
local a = {}
for i = 1, k do
  a[i] = io.read("*n")
end

local edge = {}
local asked = {}
local cpos = {}
local len = {}
local stpos = {}
for i = 1, n do
  edge[i] = {}
  asked[i] = false
  cpos[i] = 0
  len[i] = 0
  stpos[i] = 0
end
len[n + 1] = 1000000007
for i = 1, n - 1 do
  local x, y = io.read("*n", "*n")
  table.insert(edge[x], y)
  table.insert(edge[y], x)
end
local st = SegTree.new(2 * n - 1, function(a, b) return len[a] < len[b] and a or b end, n + 1)

local tasks = {1}
local sti = 1
while 0 < #tasks do
  local src = tasks[#tasks]
  table.remove(tasks)
  asked[src] = true
  if stpos[src] == 0 then stpos[src] = sti end
  st:setValue(sti, src, true)
  sti = sti + 1
  while cpos[src] < #edge[src] do
    cpos[src] = cpos[src] + 1
    local dst = edge[src][cpos[src]]
    if not asked[dst] then
      len[dst] = len[src] + 1
      c[dst] = mma(c[dst], c[src])
      table.insert(tasks, src)
      table.insert(tasks, dst)
      break
    end
  end
end
st:updateAll()

local stmin = SegTree.new(k, mmi, 2 * n + 10)
local stmax = SegTree.new(k, mma, 0)
for i = 1, k do
  local stp = stpos[a[i]]
  stmin:setValue(i, stp, true)
  stmax:setValue(i, stp, true)
end
stmin:updateAll()
stmax:updateAll()
for iq = 1, q do
  local tp, a, b = io.read("*n", "*n", "*n")
  if tp == 1 then
    local stp = stpos[b]
    stmin:setValue(a, stp)
    stmax:setValue(a, stp)
  else
    local stl = stmin:getRange(a, b)
    local str = stmax:getRange(a, b)
    local v = st:getRange(stl, str)
    print(c[v])
  end
end
0