結果
問題 | No.1332 Range Nearest Query |
ユーザー | penguinman |
提出日時 | 2020-11-04 06:49:07 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,857 ms / 2,500 ms |
コード長 | 3,534 bytes |
コンパイル時間 | 285 ms |
コンパイル使用メモリ | 86,948 KB |
実行使用メモリ | 172,808 KB |
最終ジャッジ日時 | 2023-09-29 16:38:11 |
合計ジャッジ時間 | 53,093 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
71,292 KB |
testcase_01 | AC | 73 ms
71,264 KB |
testcase_02 | AC | 74 ms
71,248 KB |
testcase_03 | AC | 1,583 ms
163,968 KB |
testcase_04 | AC | 1,396 ms
163,476 KB |
testcase_05 | AC | 1,831 ms
165,044 KB |
testcase_06 | AC | 811 ms
164,876 KB |
testcase_07 | AC | 832 ms
164,632 KB |
testcase_08 | AC | 829 ms
164,884 KB |
testcase_09 | AC | 842 ms
164,960 KB |
testcase_10 | AC | 836 ms
164,768 KB |
testcase_11 | AC | 822 ms
163,924 KB |
testcase_12 | AC | 821 ms
164,820 KB |
testcase_13 | AC | 839 ms
164,708 KB |
testcase_14 | AC | 823 ms
164,692 KB |
testcase_15 | AC | 835 ms
164,616 KB |
testcase_16 | AC | 1,776 ms
171,592 KB |
testcase_17 | AC | 1,410 ms
170,704 KB |
testcase_18 | AC | 1,707 ms
170,684 KB |
testcase_19 | AC | 1,825 ms
172,340 KB |
testcase_20 | AC | 1,717 ms
171,748 KB |
testcase_21 | AC | 1,857 ms
172,808 KB |
testcase_22 | AC | 1,479 ms
171,384 KB |
testcase_23 | AC | 1,596 ms
170,220 KB |
testcase_24 | AC | 1,597 ms
170,504 KB |
testcase_25 | AC | 1,732 ms
171,408 KB |
testcase_26 | AC | 514 ms
161,684 KB |
testcase_27 | AC | 562 ms
159,708 KB |
testcase_28 | AC | 309 ms
87,716 KB |
testcase_29 | AC | 421 ms
87,844 KB |
testcase_30 | AC | 429 ms
87,792 KB |
testcase_31 | AC | 176 ms
88,560 KB |
testcase_32 | AC | 407 ms
87,828 KB |
testcase_33 | AC | 420 ms
88,112 KB |
testcase_34 | AC | 248 ms
88,988 KB |
testcase_35 | AC | 309 ms
87,860 KB |
testcase_36 | AC | 293 ms
88,060 KB |
testcase_37 | AC | 413 ms
87,644 KB |
testcase_38 | AC | 1,319 ms
127,092 KB |
testcase_39 | AC | 670 ms
91,616 KB |
testcase_40 | AC | 1,616 ms
169,804 KB |
testcase_41 | AC | 953 ms
103,388 KB |
testcase_42 | AC | 1,266 ms
125,276 KB |
testcase_43 | AC | 1,094 ms
111,464 KB |
testcase_44 | AC | 1,653 ms
154,008 KB |
testcase_45 | AC | 1,555 ms
148,128 KB |
testcase_46 | AC | 1,039 ms
115,240 KB |
testcase_47 | AC | 1,508 ms
143,168 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=1e9 N=int(input()) A=[-inf]*N X=list(map(int,input().split())) Q=int(input()) ind=[[]for i in range(N)] lef=[[]for i in range(N)] po=[[]for i in range(N)] for i in range(Q): l,r,x=map(int, input().split()) ind[r-1].append(i) lef[r-1].append(l-1) po[r-1].append(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[i][j] point=po[i][j] 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])