結果

問題 No.1332 Range Nearest Query
ユーザー mkawa2mkawa2
提出日時 2021-01-09 14:25:20
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,355 ms / 2,500 ms
コード長 5,800 bytes
コンパイル時間 178 ms
コンパイル使用メモリ 82,836 KB
実行使用メモリ 155,956 KB
最終ジャッジ日時 2024-04-28 21:45:04
合計ジャッジ時間 66,853 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
53,376 KB
testcase_01 AC 42 ms
53,248 KB
testcase_02 AC 40 ms
53,888 KB
testcase_03 AC 2,104 ms
139,576 KB
testcase_04 AC 2,164 ms
139,420 KB
testcase_05 AC 2,106 ms
139,312 KB
testcase_06 AC 996 ms
155,644 KB
testcase_07 AC 1,003 ms
155,128 KB
testcase_08 AC 1,012 ms
155,136 KB
testcase_09 AC 1,013 ms
155,256 KB
testcase_10 AC 1,013 ms
155,396 KB
testcase_11 AC 999 ms
155,136 KB
testcase_12 AC 1,018 ms
155,264 KB
testcase_13 AC 1,029 ms
155,184 KB
testcase_14 AC 1,010 ms
155,436 KB
testcase_15 AC 1,021 ms
155,384 KB
testcase_16 AC 2,293 ms
155,928 KB
testcase_17 AC 2,299 ms
155,260 KB
testcase_18 AC 2,297 ms
155,136 KB
testcase_19 AC 2,350 ms
155,260 KB
testcase_20 AC 2,269 ms
155,644 KB
testcase_21 AC 2,286 ms
155,136 KB
testcase_22 AC 2,355 ms
155,388 KB
testcase_23 AC 2,304 ms
155,772 KB
testcase_24 AC 2,339 ms
155,780 KB
testcase_25 AC 2,349 ms
155,956 KB
testcase_26 AC 605 ms
151,696 KB
testcase_27 AC 413 ms
153,772 KB
testcase_28 AC 559 ms
98,176 KB
testcase_29 AC 602 ms
98,560 KB
testcase_30 AC 660 ms
98,504 KB
testcase_31 AC 345 ms
93,940 KB
testcase_32 AC 638 ms
98,048 KB
testcase_33 AC 653 ms
98,432 KB
testcase_34 AC 451 ms
96,000 KB
testcase_35 AC 567 ms
98,304 KB
testcase_36 AC 552 ms
97,280 KB
testcase_37 AC 614 ms
98,204 KB
testcase_38 AC 1,546 ms
114,688 KB
testcase_39 AC 869 ms
98,816 KB
testcase_40 AC 2,236 ms
152,148 KB
testcase_41 AC 1,103 ms
101,120 KB
testcase_42 AC 1,504 ms
114,804 KB
testcase_43 AC 1,270 ms
106,880 KB
testcase_44 AC 1,870 ms
122,464 KB
testcase_45 AC 1,769 ms
120,948 KB
testcase_46 AC 1,504 ms
110,592 KB
testcase_47 AC 1,649 ms
117,600 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [[(-1, 0), (1, 0)], [(0, -1), (0, 1)]]
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

    # [l,r)でaより小さい要素のうち最右のインデックス
    def LessR(self, l, r, a):
        stack = [(0, 0, self.tree_width)]
        while stack:
            u, ul, ur = stack.pop()
            if ur-ul == 1: return u-self.tree_width+1
            um = (ul+ur)//2
            if self.tree[u*2+1] < a and ul < r and l < um:
                stack.append((u*2+1, ul, um))
            if self.tree[u*2+2] < a and um < r and l < ur:
                stack.append((u*2+2, um, ur))
        return -1

    # [l,r)でaより小さい要素のうち最左のインデックス
    def LessL(self, l, r, a):
        stack = [(0, 0, self.tree_width)]
        while stack:
            u, ul, ur = stack.pop()
            if ur-ul == 1: return u-self.tree_width+1
            um = (ul+ur)//2
            if self.tree[u*2+2] < a and um < r and l < ur:
                stack.append((u*2+2, um, ur))
            if self.tree[u*2+1] < a and ul < r and l < um:
                stack.append((u*2+1, ul, um))
        return -1

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

    # [l,r)でaより大きい要素のうち最右のインデックス
    def OverR(self, l, r, a):
        stack = [(0, 0, self.tree_width)]
        while stack:
            u, ul, ur = stack.pop()
            if ur-ul == 1: return u-self.tree_width+1
            um = (ul+ur)//2
            if self.tree[u*2+1] > a and ul < r and l < um:
                stack.append((u*2+1, ul, um))
            if self.tree[u*2+2] > a and um < r and l < ur:
                stack.append((u*2+2, um, ur))
        return -1

    # [l,r)でaより大きい要素のうち最左のインデックス
    def OverL(self, l, r, a):
        stack = [(0, 0, self.tree_width)]
        while stack:
            u, ul, ur = stack.pop()
            if ur-ul == 1: return u-self.tree_width+1
            um = (ul+ur)//2
            if self.tree[u*2+2] > a and um < r and l < ur:
                stack.append((u*2+2, um, ur))
            if self.tree[u*2+1] > a and ul < r and l < um:
                stack.append((u*2+1, ul, um))
        return -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()

mn=SegtreeMin(xx)
mx=SegtreeMax(n)
ans=[-1]*q
xj=[(x,j) for j,x in enumerate(xx)]
xj.sort(reverse=True)

for x,l,r,i in xlri:
    while xj and xj[-1][0]<x:
        x0,j=xj.pop()
        mn.update(j,inf)
        mx.update(j,x0)
    ans[i]=min(mn.min(l,r)-x,x-mx.max(l,r))

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