結果
問題 | No.1332 Range Nearest Query |
ユーザー | maspy |
提出日時 | 2021-01-08 22:46:40 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,384 ms / 2,500 ms |
コード長 | 1,564 bytes |
コンパイル時間 | 788 ms |
コンパイル使用メモリ | 86,876 KB |
実行使用メモリ | 269,616 KB |
最終ジャッジ日時 | 2023-08-10 10:53:20 |
合計ジャッジ時間 | 71,541 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
71,320 KB |
testcase_01 | AC | 69 ms
71,424 KB |
testcase_02 | AC | 70 ms
71,272 KB |
testcase_03 | AC | 2,194 ms
257,396 KB |
testcase_04 | AC | 2,215 ms
247,480 KB |
testcase_05 | AC | 2,239 ms
257,700 KB |
testcase_06 | AC | 1,149 ms
265,756 KB |
testcase_07 | AC | 1,159 ms
266,012 KB |
testcase_08 | AC | 1,179 ms
265,880 KB |
testcase_09 | AC | 1,154 ms
266,012 KB |
testcase_10 | AC | 1,147 ms
265,932 KB |
testcase_11 | AC | 1,153 ms
265,928 KB |
testcase_12 | AC | 1,170 ms
265,792 KB |
testcase_13 | AC | 1,147 ms
265,948 KB |
testcase_14 | AC | 1,179 ms
265,840 KB |
testcase_15 | AC | 1,165 ms
265,872 KB |
testcase_16 | AC | 2,354 ms
266,848 KB |
testcase_17 | AC | 2,332 ms
269,248 KB |
testcase_18 | AC | 2,313 ms
268,116 KB |
testcase_19 | AC | 2,384 ms
266,660 KB |
testcase_20 | AC | 2,359 ms
266,492 KB |
testcase_21 | AC | 2,292 ms
266,792 KB |
testcase_22 | AC | 2,258 ms
266,896 KB |
testcase_23 | AC | 2,246 ms
269,616 KB |
testcase_24 | AC | 2,275 ms
269,176 KB |
testcase_25 | AC | 2,238 ms
266,900 KB |
testcase_26 | AC | 1,289 ms
268,624 KB |
testcase_27 | AC | 1,262 ms
266,364 KB |
testcase_28 | AC | 284 ms
109,836 KB |
testcase_29 | AC | 352 ms
109,816 KB |
testcase_30 | AC | 383 ms
109,904 KB |
testcase_31 | AC | 242 ms
109,796 KB |
testcase_32 | AC | 433 ms
109,976 KB |
testcase_33 | AC | 405 ms
109,728 KB |
testcase_34 | AC | 261 ms
110,004 KB |
testcase_35 | AC | 297 ms
109,864 KB |
testcase_36 | AC | 294 ms
109,796 KB |
testcase_37 | AC | 364 ms
109,896 KB |
testcase_38 | AC | 1,839 ms
185,000 KB |
testcase_39 | AC | 1,102 ms
114,772 KB |
testcase_40 | AC | 2,329 ms
266,756 KB |
testcase_41 | AC | 1,489 ms
136,228 KB |
testcase_42 | AC | 1,912 ms
177,620 KB |
testcase_43 | AC | 1,713 ms
148,264 KB |
testcase_44 | AC | 2,119 ms
229,564 KB |
testcase_45 | AC | 2,083 ms
208,776 KB |
testcase_46 | AC | 1,758 ms
171,764 KB |
testcase_47 | AC | 1,931 ms
190,076 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)