結果
問題 | No.1332 Range Nearest Query |
ユーザー | maspy |
提出日時 | 2021-01-08 23:11:44 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,032 ms / 2,500 ms |
コード長 | 1,563 bytes |
コンパイル時間 | 221 ms |
コンパイル使用メモリ | 81,820 KB |
実行使用メモリ | 213,564 KB |
最終ジャッジ日時 | 2024-04-28 05:08:58 |
合計ジャッジ時間 | 60,353 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
52,096 KB |
testcase_01 | AC | 36 ms
52,096 KB |
testcase_02 | AC | 36 ms
52,480 KB |
testcase_03 | AC | 1,880 ms
197,076 KB |
testcase_04 | AC | 1,810 ms
196,696 KB |
testcase_05 | AC | 1,936 ms
197,852 KB |
testcase_06 | AC | 934 ms
205,120 KB |
testcase_07 | AC | 933 ms
204,996 KB |
testcase_08 | AC | 1,259 ms
204,972 KB |
testcase_09 | AC | 978 ms
205,104 KB |
testcase_10 | AC | 911 ms
205,620 KB |
testcase_11 | AC | 914 ms
205,104 KB |
testcase_12 | AC | 946 ms
205,364 KB |
testcase_13 | AC | 965 ms
205,244 KB |
testcase_14 | AC | 948 ms
205,508 KB |
testcase_15 | AC | 925 ms
205,364 KB |
testcase_16 | AC | 1,909 ms
212,692 KB |
testcase_17 | AC | 2,000 ms
213,564 KB |
testcase_18 | AC | 2,032 ms
213,048 KB |
testcase_19 | AC | 1,946 ms
212,024 KB |
testcase_20 | AC | 2,003 ms
212,924 KB |
testcase_21 | AC | 1,986 ms
213,176 KB |
testcase_22 | AC | 1,917 ms
211,260 KB |
testcase_23 | AC | 1,915 ms
212,284 KB |
testcase_24 | AC | 1,975 ms
212,672 KB |
testcase_25 | AC | 1,956 ms
212,168 KB |
testcase_26 | AC | 1,073 ms
211,256 KB |
testcase_27 | AC | 1,057 ms
206,144 KB |
testcase_28 | AC | 233 ms
109,568 KB |
testcase_29 | AC | 350 ms
110,080 KB |
testcase_30 | AC | 372 ms
108,800 KB |
testcase_31 | AC | 226 ms
110,080 KB |
testcase_32 | AC | 415 ms
109,696 KB |
testcase_33 | AC | 389 ms
109,440 KB |
testcase_34 | AC | 244 ms
109,824 KB |
testcase_35 | AC | 287 ms
110,336 KB |
testcase_36 | AC | 280 ms
109,568 KB |
testcase_37 | AC | 296 ms
108,800 KB |
testcase_38 | AC | 1,701 ms
148,380 KB |
testcase_39 | AC | 994 ms
114,944 KB |
testcase_40 | AC | 1,933 ms
209,236 KB |
testcase_41 | AC | 1,282 ms
119,212 KB |
testcase_42 | AC | 1,619 ms
146,680 KB |
testcase_43 | AC | 1,485 ms
131,108 KB |
testcase_44 | AC | 1,774 ms
182,676 KB |
testcase_45 | AC | 1,759 ms
165,208 KB |
testcase_46 | AC | 1,469 ms
140,692 KB |
testcase_47 | AC | 1,772 ms
156,284 KB |
ソースコード
import sys from bisect import bisect read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines INF = 1 << 30 def main(V, query): def merge(A, B): return C N = len(V) seg = [None for _ in range(N + N)] for i in range(N): seg[N + i] = [V[i]] for k in range(N - 1, 0, -1): A, B = seg[k + k], seg[k + k + 1] NA, NB = len(A), len(B) i, j = 0, 0 C = [0] * (NA + NB) for c in range(NA + NB): if i == NA: C[c] = B[j] j += 1 elif j == NB: C[c] = A[i] i += 1 else: if A[i] > B[j]: C[c] = B[j] j += 1 else: C[c] = A[i] i += 1 seg[k] = C def nearest(A, x): n = len(A) i = bisect(A, x) v = INF if i > 0: v = x - A[i - 1] if i < n: v = min(v, A[i] - x) return v for L, R, x in query: L -= 1 L += N R += N v = INF while L < R: if L & 1: v = min(v, nearest(seg[L], x)) L += 1 if R & 1: R -= 1 v = min(v, nearest(seg[R], x)) L, R = L >> 1, R >> 1 print(v) N = int(readline()) X = tuple(map(int, readline().split())) Q = int(readline()) m = map(int, read().split()) query = zip(m, m, m) main(X, query)