結果
問題 | No.1332 Range Nearest Query |
ユーザー | penguinman |
提出日時 | 2020-11-23 05:22:27 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,989 ms / 2,500 ms |
コード長 | 3,506 bytes |
コンパイル時間 | 375 ms |
コンパイル使用メモリ | 87,268 KB |
実行使用メモリ | 146,516 KB |
最終ジャッジ日時 | 2023-09-30 23:33:26 |
合計ジャッジ時間 | 56,093 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
71,284 KB |
testcase_01 | AC | 93 ms
71,088 KB |
testcase_02 | AC | 69 ms
71,212 KB |
testcase_03 | AC | 1,599 ms
130,876 KB |
testcase_04 | AC | 1,599 ms
130,992 KB |
testcase_05 | AC | 1,579 ms
131,304 KB |
testcase_06 | AC | 858 ms
146,020 KB |
testcase_07 | AC | 896 ms
146,160 KB |
testcase_08 | AC | 827 ms
146,116 KB |
testcase_09 | AC | 813 ms
146,224 KB |
testcase_10 | AC | 850 ms
145,988 KB |
testcase_11 | AC | 842 ms
146,160 KB |
testcase_12 | AC | 824 ms
146,068 KB |
testcase_13 | AC | 822 ms
146,252 KB |
testcase_14 | AC | 851 ms
146,032 KB |
testcase_15 | AC | 827 ms
146,124 KB |
testcase_16 | AC | 1,778 ms
146,132 KB |
testcase_17 | AC | 1,806 ms
146,052 KB |
testcase_18 | AC | 1,787 ms
146,216 KB |
testcase_19 | AC | 1,969 ms
146,516 KB |
testcase_20 | AC | 1,989 ms
146,360 KB |
testcase_21 | AC | 1,891 ms
146,292 KB |
testcase_22 | AC | 1,912 ms
146,056 KB |
testcase_23 | AC | 1,892 ms
146,112 KB |
testcase_24 | AC | 1,868 ms
146,048 KB |
testcase_25 | AC | 1,855 ms
145,988 KB |
testcase_26 | AC | 516 ms
146,196 KB |
testcase_27 | AC | 529 ms
146,172 KB |
testcase_28 | AC | 410 ms
87,968 KB |
testcase_29 | AC | 409 ms
88,344 KB |
testcase_30 | AC | 414 ms
87,564 KB |
testcase_31 | AC | 336 ms
86,616 KB |
testcase_32 | AC | 420 ms
87,520 KB |
testcase_33 | AC | 425 ms
87,932 KB |
testcase_34 | AC | 383 ms
87,312 KB |
testcase_35 | AC | 401 ms
87,272 KB |
testcase_36 | AC | 403 ms
87,560 KB |
testcase_37 | AC | 408 ms
88,272 KB |
testcase_38 | AC | 1,205 ms
101,564 KB |
testcase_39 | AC | 610 ms
89,068 KB |
testcase_40 | AC | 1,803 ms
138,892 KB |
testcase_41 | AC | 796 ms
93,304 KB |
testcase_42 | AC | 1,170 ms
101,308 KB |
testcase_43 | AC | 946 ms
98,876 KB |
testcase_44 | AC | 1,506 ms
121,764 KB |
testcase_45 | AC | 1,399 ms
115,740 KB |
testcase_46 | AC | 1,087 ms
98,592 KB |
testcase_47 | AC | 1,313 ms
111,080 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()) X=list(map(int,input().split())) Q=int(input()) #data[i][1] が正ならクエリ、そうでなければ座標 data=[[] for i in range(N+Q)] left=[0]*Q right=[0]*Q for i in range(N): data[i]=(X[i],-i) for i in range(Q): left[i],right[i],x=map(int, input().split()) data[i+N]=(x,i+1) ans=[inf]*Q A=[-inf]*N seg=SegTree(A,max,-inf) data.sort() for i in range(N+Q): if data[i][1]<=0: seg.set(-data[i][1],data[i][0]) else: index=data[i][1]-1 ans[index]=min(ans[index],data[i][0]-seg.prod(left[index]-1,right[index])) for i in range(len(seg.node)): seg.node[i]=-inf for a in range(N+Q): i=N+Q-1-a if data[i][1]<=0: seg.set(-data[i][1],inf-data[i][0]) else: index=data[i][1]-1 ans[index]=min(ans[index],inf-data[i][0]-seg.prod(left[index]-1,right[index])) for i in range(Q): print(ans[i])