結果

問題 No.1332 Range Nearest Query
ユーザー mkawa2mkawa2
提出日時 2021-01-09 17:11:39
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,876 ms / 2,500 ms
コード長 4,096 bytes
コンパイル時間 259 ms
コンパイル使用メモリ 81,948 KB
実行使用メモリ 153,792 KB
最終ジャッジ日時 2024-04-29 01:06:47
合計ジャッジ時間 54,095 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
69,188 KB
testcase_01 AC 62 ms
68,328 KB
testcase_02 AC 54 ms
67,624 KB
testcase_03 AC 1,642 ms
140,452 KB
testcase_04 AC 1,613 ms
138,672 KB
testcase_05 AC 1,610 ms
138,412 KB
testcase_06 AC 807 ms
152,972 KB
testcase_07 AC 796 ms
153,088 KB
testcase_08 AC 831 ms
153,216 KB
testcase_09 AC 815 ms
153,632 KB
testcase_10 AC 807 ms
153,792 KB
testcase_11 AC 801 ms
152,956 KB
testcase_12 AC 809 ms
153,112 KB
testcase_13 AC 844 ms
153,164 KB
testcase_14 AC 813 ms
153,144 KB
testcase_15 AC 833 ms
153,036 KB
testcase_16 AC 1,848 ms
153,120 KB
testcase_17 AC 1,825 ms
153,532 KB
testcase_18 AC 1,825 ms
153,272 KB
testcase_19 AC 1,823 ms
153,596 KB
testcase_20 AC 1,876 ms
153,508 KB
testcase_21 AC 1,833 ms
153,788 KB
testcase_22 AC 1,802 ms
153,156 KB
testcase_23 AC 1,849 ms
153,104 KB
testcase_24 AC 1,825 ms
153,172 KB
testcase_25 AC 1,787 ms
153,388 KB
testcase_26 AC 425 ms
149,056 KB
testcase_27 AC 417 ms
150,196 KB
testcase_28 AC 475 ms
100,104 KB
testcase_29 AC 511 ms
99,856 KB
testcase_30 AC 544 ms
100,492 KB
testcase_31 AC 324 ms
97,084 KB
testcase_32 AC 545 ms
100,084 KB
testcase_33 AC 559 ms
100,596 KB
testcase_34 AC 402 ms
98,324 KB
testcase_35 AC 483 ms
100,604 KB
testcase_36 AC 487 ms
98,704 KB
testcase_37 AC 527 ms
100,364 KB
testcase_38 AC 1,238 ms
127,032 KB
testcase_39 AC 669 ms
101,900 KB
testcase_40 AC 1,784 ms
148,956 KB
testcase_41 AC 850 ms
106,304 KB
testcase_42 AC 1,180 ms
124,848 KB
testcase_43 AC 970 ms
113,980 KB
testcase_44 AC 1,474 ms
135,364 KB
testcase_45 AC 1,358 ms
131,892 KB
testcase_46 AC 1,138 ms
120,556 KB
testcase_47 AC 1,291 ms
130,452 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()
xlri=[]
for i in range(q):
    l,r,x=MI()
    l-=1
    xlri.append((x,l,r,i))
xlri.sort()

xj=[(x,j) for j,x in enumerate(xx)]
xj.sort()

ans=[-1]*q
st=SegTree(max,-inf,n)
p=0
for x,l,r,i in xlri:
    while p<n and xj[p][0]<=x:
        x0,j=xj[p]
        st.set(j,x0)
        p+=1
    ans[i]=x-st.prod(l,r)

st=SegTree(min,inf,n)
p=n-1
for x,l,r,i in xlri[::-1]:
    while p>=0 and xj[p][0]>=x:
        x0,j=xj[p]
        st.set(j,x0)
        p-=1
    cur=st.prod(l,r)-x
    if cur<ans[i]:ans[i]=cur

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