結果

問題 No.905 Sorted?
コンテスト
ユーザー 学ぶマン
提出日時 2025-10-03 13:26:34
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 4,318 bytes
コンパイル時間 393 ms
コンパイル使用メモリ 82,700 KB
実行使用メモリ 109,216 KB
最終ジャッジ日時 2025-10-03 13:26:41
合計ジャッジ時間 6,959 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 14 WA * 9
権限があれば一括ダウンロードができます

ソースコード

diff # 

INF = 10**18
import typing

def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1
    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])

    def __str__(self): # for debug
        arr = [self.prod(i,i+1) for i in range(self._n)]
        print(str(arr))

N = int(input())
A = list(map(int, input().split()))

diff = []
for i in range(N - 1):
    a, nex = A[i], A[i + 1]
    memo = nex - a
    if memo < 0:
        memo = -1
    elif memo > 0:
        memo = 1
    diff.append(memo)

Q = int(input())

def op1(x, y):
    return max(x, y)
E = -2
st_max = SegTree(op1, E, diff)

def op2(x, y):
    return min(x, y)
E = 2
st_min = SegTree(op2, E, diff)

ansl = []
for i in range(Q):
    l, r = map(int, input().split())

    if l == r:
        ansl.append((1, 1))
        continue
    # [l, r)
    M = st_max.prod(l, r)
    m = st_min.prod(l, r)

    # 0 だけ
    if M == m == 0:
        ans = (1, 1)
    elif m > 0: # 全部＋
        ans = (1, 0)
    elif M < 0: # 全部ー
        ans = (0, 1)
    else:
        ans = (0, 0)
    ansl.append(ans)

for a in ansl:
    print(*a)
0