結果

問題 No.1332 Range Nearest Query
ユーザー mkawa2mkawa2
提出日時 2021-01-09 18:48:05
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,073 bytes
コンパイル時間 343 ms
コンパイル使用メモリ 81,920 KB
実行使用メモリ 174,912 KB
最終ジャッジ日時 2024-11-18 09:03:06
合計ジャッジ時間 63,115 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 64 ms
67,456 KB
testcase_01 AC 64 ms
67,456 KB
testcase_02 AC 64 ms
67,200 KB
testcase_03 AC 2,037 ms
158,996 KB
testcase_04 AC 1,922 ms
158,280 KB
testcase_05 AC 1,975 ms
158,612 KB
testcase_06 AC 1,017 ms
171,804 KB
testcase_07 AC 983 ms
171,548 KB
testcase_08 AC 1,020 ms
173,932 KB
testcase_09 AC 985 ms
171,556 KB
testcase_10 AC 1,114 ms
171,640 KB
testcase_11 AC 999 ms
173,540 KB
testcase_12 AC 995 ms
171,520 KB
testcase_13 AC 1,018 ms
173,796 KB
testcase_14 AC 1,022 ms
171,500 KB
testcase_15 AC 1,029 ms
171,788 KB
testcase_16 AC 2,181 ms
174,292 KB
testcase_17 AC 2,167 ms
174,156 KB
testcase_18 AC 2,214 ms
174,556 KB
testcase_19 AC 2,271 ms
174,028 KB
testcase_20 AC 2,146 ms
174,532 KB
testcase_21 AC 2,284 ms
174,540 KB
testcase_22 AC 2,252 ms
174,140 KB
testcase_23 AC 2,329 ms
174,172 KB
testcase_24 TLE -
testcase_25 AC 2,263 ms
173,916 KB
testcase_26 AC 649 ms
169,776 KB
testcase_27 AC 648 ms
171,416 KB
testcase_28 AC 465 ms
98,900 KB
testcase_29 AC 482 ms
99,164 KB
testcase_30 AC 490 ms
99,792 KB
testcase_31 AC 411 ms
98,780 KB
testcase_32 AC 488 ms
99,876 KB
testcase_33 AC 480 ms
99,384 KB
testcase_34 AC 392 ms
99,032 KB
testcase_35 AC 422 ms
99,284 KB
testcase_36 AC 423 ms
99,152 KB
testcase_37 AC 425 ms
99,540 KB
testcase_38 AC 1,287 ms
137,344 KB
testcase_39 AC 662 ms
101,784 KB
testcase_40 AC 2,117 ms
172,672 KB
testcase_41 AC 864 ms
108,520 KB
testcase_42 AC 1,276 ms
134,760 KB
testcase_43 AC 996 ms
120,180 KB
testcase_44 AC 1,885 ms
151,668 KB
testcase_45 AC 1,724 ms
144,860 KB
testcase_46 AC 1,209 ms
128,224 KB
testcase_47 AC 1,375 ms
144,172 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()

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