結果

問題 No.1332 Range Nearest Query
ユーザー mkawa2mkawa2
提出日時 2021-01-09 16:10:47
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,498 ms / 2,500 ms
コード長 3,383 bytes
コンパイル時間 220 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 151,328 KB
最終ジャッジ日時 2024-04-28 23:47:27
合計ジャッジ時間 73,103 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
52,864 KB
testcase_01 AC 42 ms
52,736 KB
testcase_02 AC 40 ms
52,480 KB
testcase_03 AC 2,200 ms
119,400 KB
testcase_04 AC 2,289 ms
119,324 KB
testcase_05 AC 2,304 ms
119,724 KB
testcase_06 AC 1,191 ms
146,520 KB
testcase_07 AC 1,199 ms
146,704 KB
testcase_08 AC 1,131 ms
146,744 KB
testcase_09 AC 1,188 ms
146,528 KB
testcase_10 AC 1,176 ms
146,388 KB
testcase_11 AC 1,170 ms
146,396 KB
testcase_12 AC 1,119 ms
147,032 KB
testcase_13 AC 1,183 ms
146,772 KB
testcase_14 AC 1,129 ms
146,772 KB
testcase_15 AC 1,137 ms
146,588 KB
testcase_16 AC 2,420 ms
146,516 KB
testcase_17 AC 2,434 ms
146,528 KB
testcase_18 AC 2,429 ms
146,628 KB
testcase_19 AC 2,418 ms
147,168 KB
testcase_20 AC 2,317 ms
146,392 KB
testcase_21 AC 2,495 ms
146,784 KB
testcase_22 AC 2,498 ms
146,524 KB
testcase_23 AC 2,391 ms
146,644 KB
testcase_24 AC 2,402 ms
146,416 KB
testcase_25 AC 2,336 ms
147,160 KB
testcase_26 AC 512 ms
143,192 KB
testcase_27 AC 508 ms
143,192 KB
testcase_28 AC 600 ms
98,712 KB
testcase_29 AC 675 ms
99,256 KB
testcase_30 AC 746 ms
99,256 KB
testcase_31 AC 378 ms
94,512 KB
testcase_32 AC 693 ms
98,820 KB
testcase_33 AC 710 ms
98,692 KB
testcase_34 AC 497 ms
97,588 KB
testcase_35 AC 602 ms
98,868 KB
testcase_36 AC 615 ms
97,200 KB
testcase_37 AC 670 ms
98,612 KB
testcase_38 AC 1,680 ms
113,652 KB
testcase_39 AC 951 ms
99,600 KB
testcase_40 AC 2,312 ms
151,328 KB
testcase_41 AC 1,191 ms
103,904 KB
testcase_42 AC 1,639 ms
113,656 KB
testcase_43 AC 1,354 ms
106,612 KB
testcase_44 AC 2,040 ms
116,600 KB
testcase_45 AC 1,863 ms
116,808 KB
testcase_46 AC 1,591 ms
109,312 KB
testcase_47 AC 1,796 ms
116,448 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

class SegtreeMin():
    def __init__(self, n):
        self.inf = 10**16
        aa = []
        if not isinstance(n, int):
            aa = n
            n = len(aa)
        self.tree_width = tw = 1 << (n-1).bit_length()
        self.tree = [self.inf]*(tw*2-1)
        if aa:
            self.tree[tw-1:tw-1+len(aa)] = aa
            for i in range(tw-2, -1, -1):
                self.tree[i] = min(self.tree[i*2+1], self.tree[i*2+2])

    def update(self, i, a):
        seg_i = self.tree_width-1+i
        self.tree[seg_i] = a
        while seg_i != 0:
            seg_i = (seg_i-1)//2
            self.tree[seg_i] = min(self.tree[seg_i*2+1], self.tree[seg_i*2+2])

    def element(self, i):
        return self.tree[self.tree_width-1+i]

    # [l,r)の最小値
    def min(self, l, r):
        res = self.inf
        stack = [(0, 0, self.tree_width)]
        while stack:
            seg_i, segL, segR = stack.pop()
            if l <= segL and segR <= r:
                if self.tree[seg_i] < res: res = self.tree[seg_i]
            else:
                segM = (segL+segR)//2
                if r > segL and segM > l:
                    stack.append((seg_i*2+1, segL, segM))
                if r > segM and segR > l:
                    stack.append((seg_i*2+2, segM, segR))
        return res

class SegtreeMax():
    def __init__(self, n):
        self.inf = 10**16
        aa = []
        if not isinstance(n, int):
            aa = n
            n = len(aa)
        self.tree_width = tw = 1 << (n-1).bit_length()
        self.tree = [-self.inf]*(tw*2-1)
        if aa:
            self.tree[tw-1:tw-1+len(aa)] = aa
            for i in range(tw-2, -1, -1):
                self.tree[i] = max(self.tree[i*2+1], self.tree[i*2+2])

    def update(self, i, a):
        seg_i = self.tree_width-1+i
        self.tree[seg_i] = a
        while seg_i != 0:
            seg_i = (seg_i-1)//2
            self.tree[seg_i] = max(self.tree[seg_i*2+1], self.tree[seg_i*2+2])

    def element(self, i):
        return self.tree[self.tree_width-1+i]

    # [l,r)の最大値
    def max(self, l, r):
        res = -self.inf
        stack = [(0, 0, self.tree_width)]
        while stack:
            seg_i, segL, segR = stack.pop()
            if l <= segL and segR <= r:
                if self.tree[seg_i] > res: res = self.tree[seg_i]
            else:
                segM = (segL+segR)//2
                if r > segL and segM > l:
                    stack.append((seg_i*2+1, segL, segM))
                if r > segM and segR > l:
                    stack.append((seg_i*2+2, segM, segR))
        return res

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
mx=SegtreeMax(n)
p=0
for x,l,r,i in xlri:
    while p<n and xj[p][0]<=x:
        x0,j=xj[p]
        mx.update(j,x0)
        p+=1
    ans[i]=x-mx.max(l,r)

mn=SegtreeMin(n)
p=n-1
for x,l,r,i in xlri[::-1]:
    while p>=0 and xj[p][0]>=x:
        x0,j=xj[p]
        mn.update(j,x0)
        p-=1
    cur=mn.min(l,r)-x
    if cur<ans[i]:ans[i]=cur

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