結果

問題 No.1332 Range Nearest Query
ユーザー penguinmanpenguinman
提出日時 2020-11-04 06:59:11
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,214 ms / 2,500 ms
コード長 3,489 bytes
コンパイル時間 364 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 142,620 KB
最終ジャッジ日時 2024-07-22 10:46:53
合計ジャッジ時間 38,221 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 35 ms
52,992 KB
testcase_01 AC 37 ms
53,376 KB
testcase_02 AC 37 ms
53,120 KB
testcase_03 AC 1,108 ms
131,100 KB
testcase_04 AC 919 ms
129,464 KB
testcase_05 AC 1,120 ms
132,172 KB
testcase_06 AC 628 ms
142,096 KB
testcase_07 AC 625 ms
142,348 KB
testcase_08 AC 635 ms
142,100 KB
testcase_09 AC 622 ms
142,160 KB
testcase_10 AC 625 ms
142,076 KB
testcase_11 AC 635 ms
142,296 KB
testcase_12 AC 582 ms
142,312 KB
testcase_13 AC 658 ms
142,620 KB
testcase_14 AC 625 ms
142,352 KB
testcase_15 AC 622 ms
142,308 KB
testcase_16 AC 1,200 ms
142,152 KB
testcase_17 AC 1,132 ms
142,052 KB
testcase_18 AC 1,040 ms
142,300 KB
testcase_19 AC 1,180 ms
142,304 KB
testcase_20 AC 1,208 ms
142,536 KB
testcase_21 AC 1,173 ms
142,112 KB
testcase_22 AC 1,202 ms
142,036 KB
testcase_23 AC 1,183 ms
142,340 KB
testcase_24 AC 1,214 ms
142,424 KB
testcase_25 AC 1,202 ms
142,520 KB
testcase_26 AC 376 ms
141,532 KB
testcase_27 AC 423 ms
141,688 KB
testcase_28 AC 225 ms
82,640 KB
testcase_29 AC 316 ms
83,528 KB
testcase_30 AC 318 ms
83,352 KB
testcase_31 AC 122 ms
81,432 KB
testcase_32 AC 312 ms
83,324 KB
testcase_33 AC 306 ms
82,416 KB
testcase_34 AC 201 ms
82,284 KB
testcase_35 AC 243 ms
82,340 KB
testcase_36 AC 219 ms
82,264 KB
testcase_37 AC 308 ms
83,624 KB
testcase_38 AC 910 ms
103,616 KB
testcase_39 AC 421 ms
84,516 KB
testcase_40 AC 1,169 ms
136,460 KB
testcase_41 AC 512 ms
89,952 KB
testcase_42 AC 793 ms
101,376 KB
testcase_43 AC 803 ms
96,312 KB
testcase_44 AC 1,036 ms
121,624 KB
testcase_45 AC 978 ms
116,536 KB
testcase_46 AC 845 ms
101,248 KB
testcase_47 AC 932 ms
105,344 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# Refernce: https://atcoder.jp/contests/practice2/submissions/16814531
class SegTree():
    def __init__(self, a, func, idem):
        # the number of nodes is 2n - 1
        self.n = 1 << len(a).bit_length()
        self.size = len(a)
        self.func = func
        self.idem = idem # Identity element
        self.node = [idem] * (2 * self.n - 1)
        for i in range(len(a) + self.n - 2, -1, -1):
            if i >= self.n - 1:
                self.node[i] = a[i - self.n + 1]
            else:
                self.node[i] = self.func(self.node[2 * i + 1], self.node[2 * i + 2])
            
    def get(self, x):
        return self.node[x + self.n - 1]

    def set(self, x, val):
        x += self.n - 1
        self.node[x] = val
        while x > 0:
            x = (x - 1) >> 1
            self.node[x] = self.func(self.node[2*x+1], self.node[2*x+2])
        return
    
    def prod(self, l, r):
        L, R = l + self.n, r + self.n
        s_l, s_r = self.idem, self.idem
        while L < R:
            if R & 1:
                R -= 1
                s_r = self.func(self.node[R-1], s_r)
            if L & 1:
                s_l = s_l = self.func(s_l, self.node[L-1])
                L += 1
            L >>= 1
            R >>= 1
        return self.func(s_l, s_r)

    def max_right(self, l, val):
        if l == self.size:
            return self.size
        L = l + self.n
        s = self.idem
        while 1:
            while L % 2 == 0:
                L >>= 1
            if not val(self.func(s, self.node[L - 1])):
                while L < self.n:
                    L <<= 1
                    if val(self.func(s, self.node[L-1])):
                        s = self.func(s, self.node[L-1])
                        L += 1
                return L - self.n
            s = self.func(s, self.node[L - 1])
            L += 1
            if (L & -L) == L:
                return self.size

    def min_left(self, r, val):
        if r == 0:
            return 0
        R = r + self.n
        s = self.idem
        while True:
            R -= 1
            while R > 1 and R % 2:
                R >>= 1
            if not val(self.func(self.node[R - 1], s)):
                while R < self.n:
                    R = (R << 1) + 1
                    if val(self.func(self.node[R - 1], s)):
                        s = self.func(self.node[R - 1], s)
                        R -= 1
                return R + 1 - self.n
            s = self.func(self.node[R - 1], s)
            if (R & -R) == R:
                return 0

import sys
input=sys.stdin.readline
import bisect

inf=int(1e9)
N=int(input())
A=[-inf]*N
X=list(map(int,input().split()))
Q=int(input())
ind=[[]for i in range(N)]
lef=[0]*Q
po=[0]*Q
for i in range(Q):
    l,r,x=map(int, input().split())
    ind[r-1].append(i)
    lef[i]=l-1
    po[i]=x
ans=[inf]*Q
seg=SegTree(A,max,-inf)
Y=sorted(X)
for i in range(N):
    p=bisect.bisect_left(Y,X[i])
    seg.set(p,i)
    for j in range(len(ind[i])):
        index=ind[i][j]
        left=lef[index]
        point=po[index]
        right=i
        now=bisect.bisect_left(Y,point)
        index2=seg.max_right(now,lambda  z: z<left)
        if index2<N and index2>=0 and ans[index]>Y[index2]-point:
            ans[index]=Y[index2]-point
        index2=seg.min_left(now,lambda  z: z<left)
        index2-=1
        if index2<N and index2>=0 and ans[index]>point-Y[index2]:
            ans[index]=point-Y[index2]
for i in range(Q):
    print(ans[i])
0