結果

問題 No.935 う　し　た　ぷ　に　き　あ く ん 笑　ビ　－　ム
ユーザー 👑 obakyanobakyan
提出日時 2020-03-27 20:27:27
言語 Lua
(LuaJit 2.1.1696795921)
結果
AC  
実行時間 458 ms / 2,000 ms
コード長 3,099 bytes
コンパイル時間 154 ms
コンパイル使用メモリ 6,688 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-10 16:36:07
合計ジャッジ時間 9,618 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 21 ms
6,812 KB
testcase_01 AC 57 ms
6,940 KB
testcase_02 AC 6 ms
6,944 KB
testcase_03 AC 60 ms
6,944 KB
testcase_04 AC 73 ms
6,940 KB
testcase_05 AC 9 ms
6,940 KB
testcase_06 AC 152 ms
6,940 KB
testcase_07 AC 143 ms
6,940 KB
testcase_08 AC 333 ms
6,940 KB
testcase_09 AC 208 ms
6,940 KB
testcase_10 AC 254 ms
6,944 KB
testcase_11 AC 401 ms
6,940 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 1 ms
6,944 KB
testcase_14 AC 2 ms
6,944 KB
testcase_15 AC 2 ms
6,944 KB
testcase_16 AC 2 ms
6,944 KB
testcase_17 AC 5 ms
6,940 KB
testcase_18 AC 121 ms
6,944 KB
testcase_19 AC 304 ms
6,944 KB
testcase_20 AC 232 ms
6,940 KB
testcase_21 AC 34 ms
6,944 KB
testcase_22 AC 11 ms
6,940 KB
testcase_23 AC 4 ms
6,944 KB
testcase_24 AC 6 ms
6,940 KB
testcase_25 AC 5 ms
6,944 KB
testcase_26 AC 4 ms
6,944 KB
testcase_27 AC 3 ms
6,940 KB
testcase_28 AC 6 ms
6,940 KB
testcase_29 AC 7 ms
6,944 KB
testcase_30 AC 5 ms
6,940 KB
testcase_31 AC 5 ms
6,940 KB
testcase_32 AC 6 ms
6,940 KB
testcase_33 AC 195 ms
6,944 KB
testcase_34 AC 356 ms
6,940 KB
testcase_35 AC 302 ms
6,940 KB
testcase_36 AC 72 ms
6,940 KB
testcase_37 AC 189 ms
6,940 KB
testcase_38 AC 190 ms
6,940 KB
testcase_39 AC 349 ms
6,944 KB
testcase_40 AC 389 ms
6,940 KB
testcase_41 AC 383 ms
6,944 KB
testcase_42 AC 272 ms
6,940 KB
testcase_43 AC 405 ms
6,940 KB
testcase_44 AC 151 ms
6,940 KB
testcase_45 AC 458 ms
6,944 KB
testcase_46 AC 45 ms
6,940 KB
testcase_47 AC 160 ms
6,944 KB
testcase_48 AC 114 ms
6,940 KB
testcase_49 AC 128 ms
6,940 KB
testcase_50 AC 177 ms
6,944 KB
testcase_51 AC 215 ms
6,940 KB
testcase_52 AC 207 ms
6,940 KB
testcase_53 AC 350 ms
6,944 KB
testcase_54 AC 72 ms
6,944 KB
testcase_55 AC 15 ms
6,944 KB
testcase_56 AC 270 ms
6,940 KB
testcase_57 AC 171 ms
6,944 KB
testcase_58 AC 2 ms
6,940 KB
testcase_59 AC 2 ms
6,940 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
  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, sz = 1, bls(1, stagenum - 1)
    local len = right - left + 1
    while (left - 1) % sz ~= 0 or len < sz do
      stage, sz = stage + 1, brs(sz, 1)
    end
    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.right_bound = function(self, val, left, right)
  local ret, retpos = self.emptyvalue, left - 1
  local stage, l, r = 1, left, right
  local stagenum = self.stagenum
  while true do
    local sz = bls(1, stagenum - stage)
    while (l - 1) % sz ~= 0 or r + 1 - l < sz do
      stage = stage + 1
      sz = bls(1, stagenum - stage)
    end
    local tmp = self.func(ret, self.stage[stage][mce(l / sz)])
    if tmp < val then
      ret, retpos = tmp, l + sz - 1
      if retpos == right then break end
      if l + sz <= r then stage, l, r = 1, l + sz, r
      else break end
    else
      if sz ~= 1 then stage, l, r = stage + 1, l, l + sz - 2
      else break end
    end
  end
  return retpos + 1
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", "*l")
local s = io.read()
local function addfunc(x, y) return x + y end
local st_type = SegTree.new(n, addfunc, 0)
local st_life = SegTree.new(n, addfunc, 0)
for i = 1, n do
  local tp = s:sub(i, i) == "E" and 1 or 0
  local life = io.read("*n")
  st_type:setValue(i, tp, true)
  st_life:setValue(i, life, true)
end
st_type:updateAll()
st_life:updateAll()
local q = io.read("*n")
for iq = 1, q do
  local k = io.read("*n")
  local ret = 0
  for i = 1, n do
    local pos = st_life:right_bound(k + 1, i, n) - 1
    if i <= pos then
      ret = mma(ret, st_type:getRange(i, pos))
    end
    if pos == n then break end
  end
  print(ret)
end
0