結果
問題 | No.1332 Range Nearest Query |
ユーザー | penguinman |
提出日時 | 2020-11-04 06:42:22 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,760 ms / 2,500 ms |
コード長 | 3,505 bytes |
コンパイル時間 | 382 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 172,376 KB |
最終ジャッジ日時 | 2024-07-22 10:46:14 |
合計ジャッジ時間 | 46,951 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
52,736 KB |
testcase_01 | AC | 38 ms
52,736 KB |
testcase_02 | AC | 38 ms
53,120 KB |
testcase_03 | AC | 1,601 ms
163,856 KB |
testcase_04 | AC | 1,585 ms
164,096 KB |
testcase_05 | AC | 1,558 ms
164,148 KB |
testcase_06 | AC | 744 ms
165,092 KB |
testcase_07 | AC | 801 ms
165,092 KB |
testcase_08 | AC | 755 ms
164,840 KB |
testcase_09 | AC | 724 ms
164,836 KB |
testcase_10 | AC | 744 ms
165,352 KB |
testcase_11 | AC | 728 ms
165,096 KB |
testcase_12 | AC | 714 ms
164,836 KB |
testcase_13 | AC | 812 ms
164,968 KB |
testcase_14 | AC | 756 ms
164,964 KB |
testcase_15 | AC | 774 ms
165,096 KB |
testcase_16 | AC | 1,349 ms
171,852 KB |
testcase_17 | AC | 1,634 ms
171,492 KB |
testcase_18 | AC | 1,472 ms
171,500 KB |
testcase_19 | AC | 1,731 ms
171,680 KB |
testcase_20 | AC | 1,670 ms
172,000 KB |
testcase_21 | AC | 1,509 ms
170,984 KB |
testcase_22 | AC | 1,336 ms
171,108 KB |
testcase_23 | AC | 1,399 ms
171,108 KB |
testcase_24 | AC | 1,452 ms
170,980 KB |
testcase_25 | AC | 1,546 ms
172,376 KB |
testcase_26 | AC | 470 ms
161,164 KB |
testcase_27 | AC | 507 ms
160,272 KB |
testcase_28 | AC | 259 ms
87,424 KB |
testcase_29 | AC | 350 ms
87,232 KB |
testcase_30 | AC | 357 ms
85,496 KB |
testcase_31 | AC | 143 ms
88,832 KB |
testcase_32 | AC | 352 ms
86,232 KB |
testcase_33 | AC | 357 ms
86,528 KB |
testcase_34 | AC | 212 ms
87,424 KB |
testcase_35 | AC | 255 ms
87,424 KB |
testcase_36 | AC | 244 ms
87,304 KB |
testcase_37 | AC | 353 ms
87,356 KB |
testcase_38 | AC | 922 ms
121,968 KB |
testcase_39 | AC | 536 ms
89,648 KB |
testcase_40 | AC | 1,760 ms
169,424 KB |
testcase_41 | AC | 819 ms
101,692 KB |
testcase_42 | AC | 926 ms
121,136 KB |
testcase_43 | AC | 952 ms
112,928 KB |
testcase_44 | AC | 1,485 ms
154,564 KB |
testcase_45 | AC | 1,337 ms
141,828 KB |
testcase_46 | AC | 1,077 ms
116,784 KB |
testcase_47 | AC | 1,404 ms
128,556 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=1e20 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: ans[index]=min(ans[index],Y[index2]-point) index2=seg.min_left(now,lambda z: z<left) index2-=1 if index2<N and index2>=0: ans[index]=min(ans[index],point-Y[index2]) for i in range(Q): print(ans[i])