結果

問題 No.875 Range Mindex Query
コンテスト
ユーザー Edomonndo365
提出日時 2024-06-11 16:49:22
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 659 ms / 2,000 ms
コード長 4,122 bytes
コンパイル時間 364 ms
コンパイル使用メモリ 82,540 KB
実行使用メモリ 102,628 KB
最終ジャッジ日時 2024-06-11 16:49:31
合計ジャッジ時間 7,312 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff # 

from typing import Callable, TypeVar


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

    return x


T = TypeVar("T")


class SegTree:
    def __init__(self, op: Callable[[T, T], T], e: T, v: list[T]) -> 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: T) -> 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) -> T:
        assert 0 <= p < self._n

        return self._d[p + self._size]

    def prod(self, left: int, right: int) -> T:
        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) -> T:
        return self._d[1]

    def max_right(self, left: int, f: Callable[[T], 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: Callable[[T], 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])



inf = float("inf")


class S:
    def __init__(self, value=inf, index=0):
        self.value = value
        self.index = index

    def __lt__(self, other: "S") -> bool:
        if self.value < other.value:
            return True
        elif self.value > other.value:
            return False
        else:
            return self.index < other.index


def op(l: S, r: S) -> S:
    if l < r:
        return l
    return r

n, q = map(int, input().split())
A = [int(x) for x in input().split()]
seg = SegTree(op, S(), [S(A[i], i+1) for i in range(n)])
for _ in range(q):
    t, l, r = map(int, input().split())
    if t == 1:
        l -= 1
        r -= 1
        tmp = seg.get(l)
        lv, li = tmp.value, tmp.index
        tmp = seg.get(r)
        rv, ri = tmp.value, tmp.index
        seg.set(l, S(rv,li))
        seg.set(r, S(lv,ri))
    else:
        l -= 1
        print(seg.prod(l, r).index)
0