#747200 (Lua) No.1859 ><<<

提出ソース

結果

問題	No.1859 ><<<
ユーザー	👑 obakyan
提出日時	2022-03-20 01:03:38
言語	Lua (LuaJit 2.1.1696795921)
結果	AC
実行時間	387 ms / 2,000 ms
コード長	8,214 bytes
コンパイル時間	78 ms
コンパイル使用メモリ	6,688 KB
実行使用メモリ	68,468 KB
最終ジャッジ日時	2024-04-15 15:27:42
合計ジャッジ時間	12,614 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	190 ms 48,436 KB
testcase_05	AC	173 ms 52,560 KB
testcase_06	AC	185 ms 48,348 KB
testcase_07	AC	165 ms 52,456 KB
testcase_08	AC	192 ms 48,416 KB
testcase_09	AC	182 ms 52,484 KB
testcase_10	AC	50 ms 11,520 KB
testcase_11	AC	187 ms 35,968 KB
testcase_12	AC	166 ms 35,712 KB
testcase_13	AC	95 ms 19,968 KB
testcase_14	AC	207 ms 37,120 KB
testcase_15	AC	303 ms 42,752 KB
testcase_16	AC	366 ms 68,424 KB
testcase_17	AC	244 ms 42,496 KB
testcase_18	AC	354 ms 68,268 KB
testcase_19	AC	236 ms 42,240 KB
testcase_20	AC	135 ms 27,904 KB
testcase_21	AC	160 ms 52,452 KB
testcase_22	AC	158 ms 52,568 KB
testcase_23	AC	126 ms 27,904 KB
testcase_24	AC	178 ms 48,456 KB
testcase_25	AC	342 ms 68,236 KB
testcase_26	AC	332 ms 42,880 KB
testcase_27	AC	358 ms 68,284 KB
testcase_28	AC	340 ms 68,276 KB
testcase_29	AC	338 ms 67,504 KB
testcase_30	AC	301 ms 42,752 KB
testcase_31	AC	306 ms 42,752 KB
testcase_32	AC	366 ms 68,320 KB
testcase_33	AC	300 ms 42,624 KB
testcase_34	AC	355 ms 68,236 KB
testcase_35	AC	387 ms 68,468 KB
testcase_36	AC	372 ms 68,308 KB
testcase_37	AC	314 ms 42,752 KB
testcase_38	AC	374 ms 68,332 KB
testcase_39	AC	373 ms 68,264 KB
testcase_40	AC	178 ms 48,452 KB
testcase_41	AC	183 ms 48,520 KB
testcase_42	AC	123 ms 25,856 KB
testcase_43	AC	177 ms 48,436 KB
testcase_44	AC	176 ms 48,392 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

local mmi, mma = math.min, math.max
local mfl, mce = math.floor, math.ceil
local function SA_IS(data, data_size, word_size)
  local suffix_array = {}
  local type_tag = {} -- -2: L, -1: S, 1~: i-th LMS
  for i = 1, data_size do
    suffix_array[i] = -1
    type_tag[i] = -2
  end
  local word_count = {}
  local word_count_sum = {}
  local word_pushback_count = {}
  local word_pushfront_count = {}
  for i = 1, word_size do
    word_count[i] = 0
    word_count_sum[i] = 0
    word_pushback_count[i] = 0
    word_pushfront_count[i] = 0
  end
  local lms_count = 0
  local lms_data_indexes = {}
  local sorted_lms_data_indexes = {}
  local lms_compressed_data = {}

  for i = 1, data_size do
    word_count[data[i]] = word_count[data[i]] + 1
  end
  word_count_sum[1] = word_count[1]
  for i = 2, word_size do
    word_count_sum[i] = word_count_sum[i - 1] + word_count[i]
  end
  local prev_type = -2
  for i = data_size - 1, 1, -1 do
    if data[i] == data[i + 1] then
      type_tag[i] = prev_type
    else
      type_tag[i] = data[i] < data[i + 1] and -1 or -2
      prev_type = type_tag[i]
    end
  end
  for i = 2, data_size do
    if type_tag[i - 1] == -2 and type_tag[i] == -1 then
      lms_count = lms_count + 1
      type_tag[i] = lms_count
      lms_data_indexes[lms_count] = i
      sorted_lms_data_indexes[lms_count] = -1
      lms_compressed_data[lms_count] = -1
    end
  end
  -- put LMS
  for i = 1, lms_count do
    local idx = lms_data_indexes[i]
    local w = data[idx]
    suffix_array[word_count_sum[w] - word_pushback_count[w]] = idx
    word_pushback_count[w] = word_pushback_count[w] + 1
  end
  -- put L
  do
    local w = data[data_size]
    local offset = w == 1 and 0 or word_count_sum[w - 1]
    suffix_array[offset + 1] = data_size
    word_pushfront_count[w] = word_pushfront_count[w] + 1
  end
  for sufa_idx = 1, data_size - 1 do
    local data_idx = suffix_array[sufa_idx]
    if 1 < data_idx then
      data_idx = data_idx - 1
      if type_tag[data_idx] == -2 then
        local w = data[data_idx]
        local offset = w == 1 and 0 or word_count_sum[w - 1]
        word_pushfront_count[w] = word_pushfront_count[w] + 1
        suffix_array[offset + word_pushfront_count[w]] = data_idx
      end
    end
  end
  -- remove LMS
  for w = 1, word_size do
    word_pushback_count[w] = 0
  end
  -- put S
  for sufa_idx = data_size, 1, -1 do
    local data_idx = suffix_array[sufa_idx]
    if 1 < data_idx then
      data_idx = data_idx - 1
      if -1 <= type_tag[data_idx] then
        local w = data[data_idx]
        suffix_array[word_count_sum[w] - word_pushback_count[w]] = data_idx
        word_pushback_count[w] = word_pushback_count[w] + 1
      end
    end
  end
  local lms_data_value = 0
  local prev_lms_index = 0
  local prev_lms_data_index = 0
  for sufa_idx = 1, data_size do
    local data_idx = suffix_array[sufa_idx]
    local lms_idx = type_tag[data_idx]
    if 1 <= lms_idx then
      local is_same = false
      if 0 < prev_lms_data_index and prev_lms_index ~= lms_count and lms_idx ~= lms_count then
        local len1 = lms_data_indexes[lms_idx + 1] - data_idx
        local len2 = lms_data_indexes[prev_lms_index + 1] - prev_lms_data_index
        if len1 == len2 then
          is_same = true
          for i = 0, len1 do
            if data[i + data_idx] ~= data[i + prev_lms_data_index] then
              is_same = false
              break
            end
          end
        end
      end
      if not is_same then
        lms_data_value = lms_data_value + 1
      end
      lms_compressed_data[lms_idx] = lms_data_value
      prev_lms_index = lms_idx
      prev_lms_data_index = data_idx
    end
  end
  if lms_data_value == lms_count then
    for i = 1, lms_count do
      sorted_lms_data_indexes[lms_compressed_data[i]] = lms_data_indexes[i]
    end
  else
    local lms_sa = SA_IS(lms_compressed_data, lms_count, lms_data_value)
    for i = 1, lms_count do
      sorted_lms_data_indexes[i] = lms_data_indexes[lms_sa[i]]
    end
  end
  for i = 1, lms_count do
    local inv = lms_count + 1 - i
    if inv <= i then break end
    sorted_lms_data_indexes[i], sorted_lms_data_indexes[inv]
      = sorted_lms_data_indexes[inv], sorted_lms_data_indexes[i]
  end
  -- Second Induced Sort
  for i = 1, data_size do
    suffix_array[i] = -1
  end
  for i = 1, word_size do
    word_pushback_count[i] = 0
    word_pushfront_count[i] = 0
  end
  -- put LMS
  for i = 1, lms_count do
    local idx = sorted_lms_data_indexes[i]
    local w = data[idx]
    suffix_array[word_count_sum[w] - word_pushback_count[w]] = idx
    word_pushback_count[w] = word_pushback_count[w] + 1
  end
  -- put L
  do
    local w = data[data_size]
    local offset = w == 1 and 0 or word_count_sum[w - 1]
    suffix_array[offset + 1] = data_size
    word_pushfront_count[w] = word_pushfront_count[w] + 1
  end
  for sufa_idx = 1, data_size - 1 do
    local data_idx = suffix_array[sufa_idx]
    if 1 < data_idx then
      data_idx = data_idx - 1
      if type_tag[data_idx] == -2 then
        local w = data[data_idx]
        local offset = w == 1 and 0 or word_count_sum[w - 1]
        word_pushfront_count[w] = word_pushfront_count[w] + 1
        suffix_array[offset + word_pushfront_count[w]] = data_idx
      end
    end
  end
  -- remove LMS
  for w = 1, word_size do
    word_pushback_count[w] = 0
  end
  -- put S
  for sufa_idx = data_size, 1, -1 do
    local data_idx = suffix_array[sufa_idx]
    if 1 < data_idx then
      data_idx = data_idx - 1
      if -1 <= type_tag[data_idx] then
        local w = data[data_idx]
        suffix_array[word_count_sum[w] - word_pushback_count[w]] = data_idx
        word_pushback_count[w] = word_pushback_count[w] + 1
      end
    end
  end
  return suffix_array
end

local SAIS = {}
SAIS.create = function(self, data, data_size, word_size)
  local sufa = SA_IS(data, data_size, word_size)
  local sufa_inv = {}
  for i = 1, data_size do sufa_inv[i] = 0 end
  for i = 1, data_size do
    sufa_inv[sufa[i]] = i
  end
  self.sufa = sufa
  self.sufa_inv = sufa_inv
  -- LCPA
  local n = data_size
  local lcpa = {}
  for i = 1, n - 1 do lcpa[i] = 0 end
  local spos = 0
  for i = 1, n do
    local lcppos = sufa_inv[i]
    if lcppos < n then
      local len = spos
      local p1, p2 = sufa[lcppos], sufa[lcppos + 1]
      p1, p2 = p1 + spos, p2 + spos
      while p1 <= n and p2 <= n do
        if data[p1] == data[p2] then
          len = len + 1
          p1, p2 = p1 + 1, p2 + 1
        else break
        end
      end
      lcpa[lcppos] = len
      spos = 1 < len and len - 1 or 0
    end
  end
  self.lcpa = lcpa
  self.n = n
  self.data = data
end

local function tblcomp(a, b, bspos)
-- return a <= b:sub(bspos, #b)
  local lim = mmi(#a, #b - bspos + 1)
  for i = 1, lim do
    if a[i] ~= b[bspos + i - 1] then
      return a[i] < b[bspos + i - 1] and true or false
    end
  end
  return #a <= #b - bspos + 1
end

SAIS.lowerBound = function(self, s)
  if tblcomp(s, self.data, self.sufa[1]) then
    return 1
  end
  if not tblcomp(s, self.data, self.sufa[self.n]) then
    return self.n + 1
  end
  local min, max = 1, self.n
  while 1 < max - min do
    local mid = mfl((min + max) / 2)
    if tblcomp(s, self.data, self.sufa[mid]) then
      max = mid
    else
      min = mid
    end
  end
  return max
end

local n = io.read("*n")
local a = {}
for i = 1, n do
  a[i] = io.read("*n")
end
io.read()
local t = {}
for i = 1, n - 1 do
  if a[i] < a[i + 1] then
    t[i] = 2
  else
    t[i] = 1
  end
end
if a[n] < a[1] then
  t[n] = 2
else
  t[n] = 1
end
for i = 1, n - 2 do
  t[n + i] = t[i]
end

local sa = SAIS
sa:create(t, 2 * n - 2, 2)

-- print(os.clock())
local s = io.read()
local z = {}
for i = 1, n - 1 do
  z[i] = s:sub(i, i) == "<" and 2 or 1
end
local lb = sa:lowerBound(z)
-- print(lb, table.concat(sa.sufa, " "), t)
if #t < lb then
  print(-1)
  os.exit()
end
local pos = sa.sufa[lb]
if n < pos then print(-1) os.exit() end
for i = 1, n - 1 do
  if z[i] ~= t[pos + i - 1] then
    print(-1) os.exit()
  end
end
local cand = pos
while true do
  if lb <= 2 * n - 4 and n - 1 <= sa.lcpa[lb] then
    lb = lb + 1
    cand = mmi(cand, sa.sufa[lb])
  else
    break
  end
end
print(cand - 1)
-- print(os.clock())

yukicoder

結果

テストケース

ソースコード