結果
問題 | No.1332 Range Nearest Query |
ユーザー | penguinman |
提出日時 | 2020-11-23 05:19:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,947 ms / 2,500 ms |
コード長 | 3,478 bytes |
コンパイル時間 | 280 ms |
コンパイル使用メモリ | 87,364 KB |
実行使用メモリ | 146,988 KB |
最終ジャッジ日時 | 2023-09-30 23:32:15 |
合計ジャッジ時間 | 51,888 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
71,332 KB |
testcase_01 | AC | 69 ms
71,360 KB |
testcase_02 | AC | 69 ms
71,384 KB |
testcase_03 | AC | 1,621 ms
139,492 KB |
testcase_04 | AC | 1,611 ms
139,360 KB |
testcase_05 | AC | 1,631 ms
139,100 KB |
testcase_06 | AC | 835 ms
146,796 KB |
testcase_07 | AC | 821 ms
146,848 KB |
testcase_08 | AC | 828 ms
146,848 KB |
testcase_09 | AC | 834 ms
146,428 KB |
testcase_10 | AC | 824 ms
146,712 KB |
testcase_11 | AC | 846 ms
146,708 KB |
testcase_12 | AC | 830 ms
146,580 KB |
testcase_13 | AC | 813 ms
146,612 KB |
testcase_14 | AC | 831 ms
146,988 KB |
testcase_15 | AC | 821 ms
146,584 KB |
testcase_16 | AC | 1,756 ms
146,964 KB |
testcase_17 | AC | 1,763 ms
146,788 KB |
testcase_18 | AC | 1,740 ms
146,672 KB |
testcase_19 | AC | 1,734 ms
146,796 KB |
testcase_20 | AC | 1,748 ms
146,872 KB |
testcase_21 | AC | 1,762 ms
146,928 KB |
testcase_22 | AC | 1,947 ms
146,724 KB |
testcase_23 | AC | 1,787 ms
146,596 KB |
testcase_24 | AC | 1,784 ms
146,672 KB |
testcase_25 | AC | 1,782 ms
146,556 KB |
testcase_26 | AC | 509 ms
146,632 KB |
testcase_27 | AC | 511 ms
146,644 KB |
testcase_28 | AC | 379 ms
87,780 KB |
testcase_29 | AC | 383 ms
88,268 KB |
testcase_30 | AC | 392 ms
87,696 KB |
testcase_31 | AC | 326 ms
86,960 KB |
testcase_32 | AC | 402 ms
87,544 KB |
testcase_33 | AC | 401 ms
88,112 KB |
testcase_34 | AC | 351 ms
86,892 KB |
testcase_35 | AC | 382 ms
87,260 KB |
testcase_36 | AC | 382 ms
87,612 KB |
testcase_37 | AC | 390 ms
87,920 KB |
testcase_38 | AC | 1,139 ms
104,624 KB |
testcase_39 | AC | 617 ms
89,588 KB |
testcase_40 | AC | 1,733 ms
144,452 KB |
testcase_41 | AC | 756 ms
93,924 KB |
testcase_42 | AC | 1,116 ms
105,140 KB |
testcase_43 | AC | 896 ms
100,820 KB |
testcase_44 | AC | 1,451 ms
126,076 KB |
testcase_45 | AC | 1,306 ms
119,924 KB |
testcase_46 | AC | 1,035 ms
100,840 KB |
testcase_47 | AC | 1,272 ms
115,552 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])) seg=SegTree(A,max,-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])