結果

問題 No.878 Range High-Element Query
ユーザー ntuda
提出日時 2025-07-09 22:03:39
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 740 ms / 2,000 ms
コード長 4,673 bytes
コンパイル時間 310 ms
コンパイル使用メモリ 82,796 KB
実行使用メモリ 123,932 KB
最終ジャッジ日時 2025-07-09 22:03:48
合計ジャッジ時間 7,800 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing

def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1
    return x

def _bsf(n: int) -> int:
    x = 0
    while n % 2 == 0:
        x += 1
        n //= 2
    return x

class SegTree:
    def __init__(self,
                 op: typing.Callable[[typing.Any, typing.Any], typing.Any],
                 e: typing.Any,
                 v: typing.Union[int, typing.List[typing.Any]]) -> None:
        self._op = op
        self._e = e

        if isinstance(v, int):
            v = [e] * v

        self._n = len(v)
        self._log = _ceil_pow2(self._n)
        self._size = 1 << self._log
        self._d = [e] * (2 * self._size)

        for i in range(self._n):
            self._d[self._size + i] = v[i]
        for i in range(self._size - 1, 0, -1):
            self._update(i)

    def set(self, p: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        p += self._size
        self._d[p] = x
        for i in range(1, self._log + 1):
            self._update(p >> i)

    def get(self, p: int) -> typing.Any:
        assert 0 <= p < self._n

        return self._d[p + self._size]

    def prod(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n
        sml = self._e
        smr = self._e
        left += self._size
        right += self._size

        while left < right:
            if left & 1:
                sml = self._op(sml, self._d[left])
                left += 1
            if right & 1:
                right -= 1
                smr = self._op(self._d[right], smr)
            left >>= 1
            right >>= 1

        return self._op(sml, smr)

    def all_prod(self) -> typing.Any:
        return self._d[1]

    def max_right(self, left: int,
                  f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= left <= self._n
        assert f(self._e)

        if left == self._n:
            return self._n

        left += self._size
        sm = self._e

        first = True
        while first or (left & -left) != left:
            first = False
            while left % 2 == 0:
                left >>= 1
            if not f(self._op(sm, self._d[left])):
                while left < self._size:
                    left *= 2
                    if f(self._op(sm, self._d[left])):
                        sm = self._op(sm, self._d[left])
                        left += 1
                return left - self._size
            sm = self._op(sm, self._d[left])
            left += 1

        return self._n

    def min_left(self, right: int,
                 f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= right <= self._n
        assert f(self._e)

        if right == 0:
            return 0

        right += self._size
        sm = self._e

        first = True
        while first or (right & -right) != right:
            first = False
            right -= 1
            while right > 1 and right % 2:
                right >>= 1
            if not f(self._op(self._d[right], sm)):
                while right < self._size:
                    right = 2 * right + 1
                    if f(self._op(self._d[right], sm)):
                        sm = self._op(self._d[right], sm)
                        right -= 1
                return right + 1 - self._size
            sm = self._op(self._d[right], sm)

        return 0

    def _update(self, k: int) -> None:
        self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1])

from collections import deque
import sys
sys.setrecursionlimit(100050)

N,Q = map(int,input().split())
A = list(map(int,input().split()))
N += 1
E = [[] for _ in range(N)]
A.append(N)
D = deque()
for i,a in enumerate(A):
    a -= 1
    while D and D[0][0] < a:
        b,id = D.popleft()
        E[i].append(id)
        E[id].append(i)
    D.appendleft((a,i))
for i in range(N):
    E[i].sort()

In = [-1] * N
Out = [-1] * N
ET = []
FA = [-1] * N
ET2 = [(0,N-1)]
cnt = 0
L = [-1] * N

def dfs(x) :
    global cnt,cnt2
    ET.append(-1)
    In[x] = cnt
    cnt += 1
    for y in E[x]:
        if FA[y]== -1:
            FA[y] = cnt2
            cnt2 += 1
            L[y] = L[x] + 1
            ET2.append((L[y],y))
            dfs(y)
            cnt2 += 1
            ET2.append((L[x],x))
    ET.append(1)
    Out[x] = cnt
    cnt += 1

FA[N-1] = 0
cnt2 = 1
L[N-1] = 0
dfs(N-1)
ST2 = SegTree(min, (N+1,0), ET2)

#print(ET)
#print(ET2)
#print(FA)
#print(In,Out)
#print(L)

for _ in range(Q):
    _,l,r= map(int,input().split())
    l -= 1
    fa = FA[l]
    fb = FA[r]
    if fa > fb:
        fa,fb = fb,fa
    c = ST2.prod(fa,fb+1)[1]
    a = L[l] - L[c]
    print(a)
0