結果

問題 No.515 典型LCP
ユーザー 👑 obakyanobakyan
提出日時 2021-07-22 13:53:42
言語 Lua
(LuaJit 2.1.1696795921)
結果
TLE  
実行時間 -
コード長 2,975 bytes
コンパイル時間 27 ms
コンパイル使用メモリ 6,688 KB
実行使用メモリ 15,564 KB
最終ジャッジ日時 2024-07-17 14:40:54
合計ジャッジ時間 4,981 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 TLE -
testcase_01 TLE -
testcase_02 AC 592 ms
6,944 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 315 ms
6,940 KB
testcase_06 AC 328 ms
6,944 KB
testcase_07 AC 328 ms
6,944 KB
testcase_08 AC 429 ms
6,940 KB
testcase_09 AC 509 ms
6,944 KB
testcase_10 AC 548 ms
6,944 KB
testcase_11 AC 550 ms
6,940 KB
testcase_12 AC 551 ms
6,944 KB
testcase_13 AC 327 ms
6,944 KB
testcase_14 AC 12 ms
6,944 KB
testcase_15 AC 162 ms
6,944 KB
testcase_16 AC 184 ms
6,944 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 = io.read("*n", "*l")
local s = {}
local idx = {}
local idxinv = {}
for i = 1, n do
  s[i] = io.read()
  idx[i] = i
  idxinv[i] = 0
end
table.sort(idx, function(a, b) return s[a] < s[b] end)
for i = 1, n do
  idxinv[idx[i]] = i
end
local st = SegTree.new(n - 1, mmi, 1000000007)
for i = 1, n - 1 do
  local s1 = s[idx[i]]
  local s2 = s[idx[i + 1]]
  local len = 0
  local n1, n2 = #s1, #s2
  while len < n1 and len < n2 and s1:byte(len + 1) == s2:byte(len + 1) do
    len = len + 1
  end
  st:setValue(i, len, true)
end
st:updateAll()

local m, x, d = io.read("*n", "*n", "*n")
local ret = 0
for i = 1, m do
  local p = mfl(x / (n - 1)) + 1
  local q = (x % (n - 1)) + 1
  if q < p then
    p, q = q, p
  else
    q = q + 1
  end
  x = (x + d) % (n * (n - 1))
  
  local pi = idxinv[p]
  local qi = idxinv[q]
  if qi < pi then pi, qi = qi, pi end
  ret = ret + st:getRange(pi, qi - 1)
end
print(ret)
0