結果

問題 No.386 貪欲な領主
コンテスト
ユーザー obakyan
提出日時 2020-05-05 15:03:40
言語 Lua
(LuaJit 2.1.1734355927)
結果
AC  
実行時間 520 ms / 2,000 ms
コード長 3,659 bytes
コンパイル時間 110 ms
コンパイル使用メモリ 6,944 KB
実行使用メモリ 30,592 KB
最終ジャッジ日時 2024-06-26 09:58:12
合計ジャッジ時間 4,304 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 16
権限があれば一括ダウンロードができます

ソースコード

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.setValue = function(self, idx, value, silent)
  self.stage[self.stagenum][idx] = value
  if not silent then
    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
end
SegTree.new = function(n, func, emptyvalue)
  local obj = {}
  setmetatable(obj, {__index = SegTree})
  obj:create(n, func, emptyvalue)
  return obj
end

local n = io.read("*n")
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")
  x, y = x + 1, y + 1
  table.insert(edge[x], y)
  table.insert(edge[y], x)
end

local cost = {}
local costsum = {}
for i = 1, n do
  cost[i] = io.read("*n")
  costsum[i] = 0
end

local st = SegTree.new(2 * n - 1, function(a, b) return len[a] < len[b] and a or b end, n + 1)

local undotask = {}
local curcost = 0
local tasks = {1}
local sti = 1
while 0 < #tasks do
  local src = tasks[#tasks]
  table.remove(tasks)
  if asked[src] then
    curcost = curcost - undotask[#undotask]
    table.remove(undotask)
  else
    curcost = curcost + cost[src]
    costsum[src] = curcost
    table.insert(undotask, cost[src])
  end
  asked[src] = true
  -- print(src, len[src])
  stpos[src] = sti
  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
      table.insert(tasks, src)
      table.insert(tasks, dst)
      break
    end
  end
end
st:updateAll()
-- print(table.concat(costsum, " "))
local q = io.read("*n")
local sum = 0
for i = 1, q do
  local a, b, c = io.read("*n", "*n", "*n")
  a, b = a + 1, b + 1
  local ap, bp = stpos[a], stpos[b]
  local root = ap < bp and st:getRange(ap, bp) or st:getRange(bp, ap)
  local v = costsum[a] + costsum[b] - costsum[root] * 2 + cost[root]
  sum = sum + v * c
end
print(sum)
0