結果
問題 | No.1332 Range Nearest Query |
ユーザー | maspy |
提出日時 | 2021-01-08 22:46:40 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,496 ms / 2,500 ms |
コード長 | 1,564 bytes |
コンパイル時間 | 285 ms |
コンパイル使用メモリ | 81,780 KB |
実行使用メモリ | 268,096 KB |
最終ジャッジ日時 | 2024-04-28 04:17:47 |
合計ジャッジ時間 | 71,201 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
53,288 KB |
testcase_01 | AC | 39 ms
52,584 KB |
testcase_02 | AC | 38 ms
53,772 KB |
testcase_03 | AC | 2,198 ms
250,276 KB |
testcase_04 | AC | 2,104 ms
250,476 KB |
testcase_05 | AC | 2,152 ms
250,108 KB |
testcase_06 | AC | 1,128 ms
265,244 KB |
testcase_07 | AC | 1,119 ms
265,540 KB |
testcase_08 | AC | 1,152 ms
265,304 KB |
testcase_09 | AC | 1,130 ms
265,312 KB |
testcase_10 | AC | 1,198 ms
265,100 KB |
testcase_11 | AC | 1,178 ms
265,132 KB |
testcase_12 | AC | 1,232 ms
264,964 KB |
testcase_13 | AC | 1,223 ms
264,944 KB |
testcase_14 | AC | 1,210 ms
265,072 KB |
testcase_15 | AC | 1,170 ms
265,368 KB |
testcase_16 | AC | 2,314 ms
266,740 KB |
testcase_17 | AC | 2,280 ms
265,560 KB |
testcase_18 | AC | 2,282 ms
265,140 KB |
testcase_19 | AC | 2,317 ms
266,476 KB |
testcase_20 | AC | 2,496 ms
266,228 KB |
testcase_21 | AC | 2,429 ms
266,588 KB |
testcase_22 | AC | 2,364 ms
266,504 KB |
testcase_23 | AC | 2,327 ms
268,016 KB |
testcase_24 | AC | 2,338 ms
268,096 KB |
testcase_25 | AC | 2,403 ms
266,636 KB |
testcase_26 | AC | 1,279 ms
265,480 KB |
testcase_27 | AC | 1,313 ms
265,760 KB |
testcase_28 | AC | 277 ms
109,036 KB |
testcase_29 | AC | 347 ms
109,104 KB |
testcase_30 | AC | 372 ms
109,184 KB |
testcase_31 | AC | 240 ms
109,056 KB |
testcase_32 | AC | 439 ms
109,184 KB |
testcase_33 | AC | 403 ms
109,056 KB |
testcase_34 | AC | 259 ms
109,036 KB |
testcase_35 | AC | 294 ms
109,184 KB |
testcase_36 | AC | 288 ms
109,088 KB |
testcase_37 | AC | 357 ms
109,156 KB |
testcase_38 | AC | 1,930 ms
185,560 KB |
testcase_39 | AC | 1,097 ms
113,904 KB |
testcase_40 | AC | 2,449 ms
264,736 KB |
testcase_41 | AC | 1,545 ms
133,112 KB |
testcase_42 | AC | 2,010 ms
182,292 KB |
testcase_43 | AC | 1,735 ms
150,504 KB |
testcase_44 | AC | 2,271 ms
224,680 KB |
testcase_45 | AC | 2,142 ms
198,760 KB |
testcase_46 | AC | 1,861 ms
169,840 KB |
testcase_47 | AC | 1,988 ms
196,804 KB |
ソースコード
import sys from bisect import bisect read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines INF = 1 << 60 def main(V, query): def merge(A, B): NA, NB = len(A), len(B) i, j = 0, 0 C = [] for _ in range(NA + NB): if i == NA: C.append(B[j]) j += 1 elif j == NB: C.append(A[i]) i += 1 else: if A[i] > B[j]: C.append(B[j]) j += 1 else: C.append(A[i]) i += 1 return C N = len(V) seg = [[] for _ in range(N + N)] for i in range(N): seg[N + i] = [V[i]] for i in range(N - 1, 0, -1): seg[i] = merge(seg[i + i], seg[i + i + 1]) def nearest(A, x): n = len(A) i = bisect(A, x) v = INF if i > 0: v = min(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 = tuple(zip(m, m, m)) main(X, query)