結果

問題 No.3305 Shift Sort
コンテスト
ユーザー sepa38
提出日時 2025-09-27 11:10:36
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,018 ms / 2,000 ms
コード長 2,210 bytes
コンパイル時間 400 ms
コンパイル使用メモリ 82,052 KB
実行使用メモリ 168,432 KB
最終ジャッジ日時 2025-09-27 11:10:58
合計ジャッジ時間 22,179 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

class segt:
  def __init__(self, n, ele, calc):
    self.num = 2 ** (n - 1).bit_length()
    self.el = ele
    self.data = [ele] * (2 * self.num)
    self.calc = calc

  def update(self, idx, x):
    idx += self.num - 1
    self.data[idx] = x
    while idx > 0:
      idx = (idx - 1) // 2
      self.data[idx] = self.calc(self.data[2*idx+1], self.data[2*idx+2])
  
  def renew(self, idx, x):
    self.update(idx, self.calc(self.get(idx), x))

  def prod(self, left, right):
    l = left + self.num
    r = right + self.num
    res = self.el
    while l < r:
      if l % 2:
        res = self.calc(res, self.data[l-1])
        l += 1
      if r % 2:
        r -= 1
        res = self.calc(res, self.data[r-1])
      l //= 2
      r //= 2
    return res

  def get(self, idx):
    return self.data[idx+self.num-1]


def solve(n, q, a, queries):
  st = segt(n, n, min)
  ls = [[n] * (n + 1) for _ in range(20)]
  for i in reversed(range(n)):
    ls[0][i] = st.prod(a[i]+1, n)
    st.update(a[i], i)
  for i in range(1, 20):
    for j in range(n+1):
      ls[i][j] = ls[i-1][ls[i-1][j]]

  ans = []
  for l, r in queries:
    cnt = 0
    j = l
    for i in reversed(range(20)):
      if ls[i][j] <= r:
        cnt += 1 << i
        j = ls[i][j]
    ans.append(r-l-cnt)

  return ans


def naive(n, q, a, queries):
  ans = []
  for l, r in queries:
    ans.append(0)
    for i in range(l+1, r+1):
      ans[-1] += max(a[l:i]) > a[i]

  return ans


n, q = map(int, input().split())
a = list(map(lambda x: int(x)-1, input().split()))
queries = [list(map(lambda x: int(x)-1, input().split())) for _ in range(q)]

assert 1 <= n <= 2 * 10 ** 5
assert 1 <= q <= 2 * 10 ** 5
assert len(set(a)) == n
assert min(a) == 0 and max(a) == n - 1
assert all([0 <= l <= r <= n - 1 for l, r in queries])

print(*solve(n, q, a, queries), sep = "\n")


import random
for _ in range(200):
  n = random.randint(5, 10)
  q = random.randint(1, 10)
  a = [i for i in range(n)]
  random.shuffle(a)
  queries = [
    sorted([random.randint(0, n-1), random.randint(0, n-1)])
    for _ in range(q)
  ]

  if solve(n, q, a, queries) != naive(n, q, a, queries):
    print(n, q)
    print(*a)
    for l, r in queries:
      print(l, r)
    break
0