結果

問題 No.1332 Range Nearest Query
ユーザー mkawa2mkawa2
提出日時 2021-01-09 18:55:57
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,001 ms / 2,500 ms
コード長 4,090 bytes
コンパイル時間 180 ms
コンパイル使用メモリ 82,328 KB
実行使用メモリ 186,696 KB
最終ジャッジ日時 2024-11-18 09:18:14
合計ジャッジ時間 58,068 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 72 ms
67,840 KB
testcase_01 AC 68 ms
67,584 KB
testcase_02 AC 72 ms
67,956 KB
testcase_03 AC 1,871 ms
157,544 KB
testcase_04 AC 1,756 ms
157,240 KB
testcase_05 AC 1,710 ms
157,152 KB
testcase_06 AC 984 ms
175,852 KB
testcase_07 AC 983 ms
176,180 KB
testcase_08 AC 997 ms
174,880 KB
testcase_09 AC 969 ms
174,976 KB
testcase_10 AC 990 ms
176,360 KB
testcase_11 AC 974 ms
174,988 KB
testcase_12 AC 988 ms
176,384 KB
testcase_13 AC 985 ms
174,760 KB
testcase_14 AC 987 ms
176,048 KB
testcase_15 AC 980 ms
176,424 KB
testcase_16 AC 1,980 ms
186,044 KB
testcase_17 AC 1,954 ms
185,656 KB
testcase_18 AC 1,956 ms
186,696 KB
testcase_19 AC 1,958 ms
186,420 KB
testcase_20 AC 1,954 ms
184,920 KB
testcase_21 AC 1,999 ms
185,840 KB
testcase_22 AC 1,998 ms
186,652 KB
testcase_23 AC 2,001 ms
183,480 KB
testcase_24 AC 1,973 ms
186,192 KB
testcase_25 AC 1,948 ms
185,856 KB
testcase_26 AC 669 ms
170,780 KB
testcase_27 AC 659 ms
173,720 KB
testcase_28 AC 407 ms
99,412 KB
testcase_29 AC 420 ms
99,132 KB
testcase_30 AC 436 ms
99,660 KB
testcase_31 AC 336 ms
98,904 KB
testcase_32 AC 440 ms
99,488 KB
testcase_33 AC 439 ms
99,872 KB
testcase_34 AC 368 ms
99,268 KB
testcase_35 AC 402 ms
99,768 KB
testcase_36 AC 414 ms
99,900 KB
testcase_37 AC 415 ms
100,052 KB
testcase_38 AC 1,266 ms
144,952 KB
testcase_39 AC 643 ms
105,680 KB
testcase_40 AC 1,855 ms
175,048 KB
testcase_41 AC 815 ms
109,652 KB
testcase_42 AC 1,159 ms
137,028 KB
testcase_43 AC 947 ms
120,592 KB
testcase_44 AC 1,550 ms
152,032 KB
testcase_45 AC 1,446 ms
146,792 KB
testcase_46 AC 1,223 ms
128,412 KB
testcase_47 AC 1,390 ms
146,320 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
inf = 10**16
# md = 998244353
md = 10**9+7

import typing

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 = (self._n-1).bit_length()
        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])

n=II()
xx=LI()
q=II()

task=[]
lr=[]
for i in range(q):
    l,r,x=MI()
    l-=1
    lr.append((l,r))
    task.append((x,1,i))

for j,x in enumerate(xx):
    task.append((x,0,j))

task.sort(key=lambda x:x[0])

ans=[-1]*q
st=SegTree(max,-inf,n)
for x,t,i in task:
    if t:
        l,r=lr[i]
        ans[i]=x-st.prod(l,r)
    else:
        st.set(i,x)

st=SegTree(min,inf,n)
for x,t,i in task[::-1]:
    if t:
        l,r=lr[i]
        cur=st.prod(l,r)-x
        if cur<ans[i]:ans[i]=cur
    else:
        st.set(i,x)

print(*ans,sep="\n")
0