結果
問題 | No.1332 Range Nearest Query |
ユーザー | penguinman |
提出日時 | 2020-11-23 05:33:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,529 ms / 2,500 ms |
コード長 | 3,486 bytes |
コンパイル時間 | 333 ms |
コンパイル使用メモリ | 87,192 KB |
実行使用メモリ | 159,296 KB |
最終ジャッジ日時 | 2023-09-30 23:34:14 |
合計ジャッジ時間 | 45,773 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
71,608 KB |
testcase_01 | AC | 72 ms
71,312 KB |
testcase_02 | AC | 73 ms
71,348 KB |
testcase_03 | AC | 1,377 ms
151,048 KB |
testcase_04 | AC | 1,371 ms
151,160 KB |
testcase_05 | AC | 1,383 ms
150,960 KB |
testcase_06 | AC | 790 ms
156,288 KB |
testcase_07 | AC | 785 ms
155,852 KB |
testcase_08 | AC | 769 ms
156,112 KB |
testcase_09 | AC | 775 ms
156,300 KB |
testcase_10 | AC | 813 ms
156,212 KB |
testcase_11 | AC | 783 ms
156,692 KB |
testcase_12 | AC | 777 ms
156,232 KB |
testcase_13 | AC | 776 ms
156,276 KB |
testcase_14 | AC | 801 ms
156,204 KB |
testcase_15 | AC | 797 ms
156,108 KB |
testcase_16 | AC | 1,511 ms
158,180 KB |
testcase_17 | AC | 1,528 ms
158,856 KB |
testcase_18 | AC | 1,501 ms
158,744 KB |
testcase_19 | AC | 1,492 ms
159,296 KB |
testcase_20 | AC | 1,492 ms
159,288 KB |
testcase_21 | AC | 1,507 ms
159,256 KB |
testcase_22 | AC | 1,529 ms
158,948 KB |
testcase_23 | AC | 1,507 ms
158,716 KB |
testcase_24 | AC | 1,518 ms
158,924 KB |
testcase_25 | AC | 1,509 ms
158,876 KB |
testcase_26 | AC | 511 ms
149,284 KB |
testcase_27 | AC | 541 ms
157,304 KB |
testcase_28 | AC | 332 ms
87,344 KB |
testcase_29 | AC | 331 ms
87,232 KB |
testcase_30 | AC | 342 ms
87,296 KB |
testcase_31 | AC | 256 ms
86,184 KB |
testcase_32 | AC | 342 ms
87,144 KB |
testcase_33 | AC | 340 ms
87,280 KB |
testcase_34 | AC | 301 ms
87,380 KB |
testcase_35 | AC | 328 ms
87,816 KB |
testcase_36 | AC | 326 ms
87,116 KB |
testcase_37 | AC | 334 ms
87,304 KB |
testcase_38 | AC | 985 ms
109,340 KB |
testcase_39 | AC | 497 ms
88,748 KB |
testcase_40 | AC | 1,484 ms
156,776 KB |
testcase_41 | AC | 652 ms
92,748 KB |
testcase_42 | AC | 960 ms
110,892 KB |
testcase_43 | AC | 741 ms
108,756 KB |
testcase_44 | AC | 1,138 ms
122,020 KB |
testcase_45 | AC | 1,062 ms
117,072 KB |
testcase_46 | AC | 898 ms
105,292 KB |
testcase_47 | AC | 994 ms
114,768 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 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(key=lambda val:val[0]) 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])