結果
問題 | No.1332 Range Nearest Query |
ユーザー | penguinman |
提出日時 | 2020-11-04 06:59:11 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,405 ms / 2,500 ms |
コード長 | 3,489 bytes |
コンパイル時間 | 371 ms |
コンパイル使用メモリ | 86,672 KB |
実行使用メモリ | 146,064 KB |
最終ジャッジ日時 | 2023-09-29 16:41:15 |
合計ジャッジ時間 | 43,297 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
70,996 KB |
testcase_01 | AC | 74 ms
71,104 KB |
testcase_02 | AC | 75 ms
71,148 KB |
testcase_03 | AC | 1,162 ms
133,100 KB |
testcase_04 | AC | 1,300 ms
133,292 KB |
testcase_05 | AC | 1,290 ms
133,620 KB |
testcase_06 | AC | 689 ms
145,656 KB |
testcase_07 | AC | 707 ms
145,484 KB |
testcase_08 | AC | 712 ms
145,908 KB |
testcase_09 | AC | 721 ms
145,812 KB |
testcase_10 | AC | 700 ms
145,696 KB |
testcase_11 | AC | 695 ms
145,816 KB |
testcase_12 | AC | 686 ms
145,784 KB |
testcase_13 | AC | 710 ms
145,960 KB |
testcase_14 | AC | 719 ms
146,064 KB |
testcase_15 | AC | 687 ms
145,788 KB |
testcase_16 | AC | 1,274 ms
145,840 KB |
testcase_17 | AC | 1,318 ms
145,896 KB |
testcase_18 | AC | 1,282 ms
145,828 KB |
testcase_19 | AC | 1,315 ms
145,812 KB |
testcase_20 | AC | 1,295 ms
145,964 KB |
testcase_21 | AC | 1,332 ms
145,812 KB |
testcase_22 | AC | 1,405 ms
145,528 KB |
testcase_23 | AC | 1,329 ms
145,796 KB |
testcase_24 | AC | 1,327 ms
145,516 KB |
testcase_25 | AC | 1,302 ms
145,956 KB |
testcase_26 | AC | 444 ms
145,580 KB |
testcase_27 | AC | 477 ms
145,404 KB |
testcase_28 | AC | 274 ms
83,308 KB |
testcase_29 | AC | 375 ms
84,192 KB |
testcase_30 | AC | 381 ms
84,212 KB |
testcase_31 | AC | 156 ms
82,064 KB |
testcase_32 | AC | 356 ms
83,768 KB |
testcase_33 | AC | 375 ms
84,192 KB |
testcase_34 | AC | 241 ms
82,996 KB |
testcase_35 | AC | 299 ms
83,376 KB |
testcase_36 | AC | 268 ms
82,892 KB |
testcase_37 | AC | 371 ms
84,208 KB |
testcase_38 | AC | 1,015 ms
106,956 KB |
testcase_39 | AC | 463 ms
86,044 KB |
testcase_40 | AC | 1,326 ms
139,196 KB |
testcase_41 | AC | 800 ms
94,824 KB |
testcase_42 | AC | 993 ms
104,764 KB |
testcase_43 | AC | 912 ms
98,876 KB |
testcase_44 | AC | 1,251 ms
125,756 KB |
testcase_45 | AC | 1,138 ms
120,132 KB |
testcase_46 | AC | 862 ms
98,472 KB |
testcase_47 | AC | 1,127 ms
116,972 KB |
ソースコード
# 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])