結果
問題 | No.1332 Range Nearest Query |
ユーザー | maspy |
提出日時 | 2021-01-08 23:14:18 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,925 ms / 2,500 ms |
コード長 | 1,562 bytes |
コンパイル時間 | 196 ms |
コンパイル使用メモリ | 82,248 KB |
実行使用メモリ | 205,792 KB |
最終ジャッジ日時 | 2024-04-28 05:21:52 |
合計ジャッジ時間 | 56,632 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
52,864 KB |
testcase_01 | AC | 33 ms
52,480 KB |
testcase_02 | AC | 34 ms
52,864 KB |
testcase_03 | AC | 1,763 ms
180,216 KB |
testcase_04 | AC | 1,777 ms
180,176 KB |
testcase_05 | AC | 1,837 ms
181,052 KB |
testcase_06 | AC | 889 ms
198,120 KB |
testcase_07 | AC | 909 ms
198,144 KB |
testcase_08 | AC | 869 ms
197,752 KB |
testcase_09 | AC | 873 ms
197,728 KB |
testcase_10 | AC | 883 ms
198,264 KB |
testcase_11 | AC | 877 ms
197,664 KB |
testcase_12 | AC | 906 ms
198,624 KB |
testcase_13 | AC | 898 ms
198,236 KB |
testcase_14 | AC | 879 ms
197,904 KB |
testcase_15 | AC | 868 ms
197,664 KB |
testcase_16 | AC | 1,819 ms
204,076 KB |
testcase_17 | AC | 1,890 ms
205,536 KB |
testcase_18 | AC | 1,916 ms
205,792 KB |
testcase_19 | AC | 1,849 ms
205,024 KB |
testcase_20 | AC | 1,894 ms
205,692 KB |
testcase_21 | AC | 1,925 ms
205,176 KB |
testcase_22 | AC | 1,816 ms
204,148 KB |
testcase_23 | AC | 1,878 ms
205,424 KB |
testcase_24 | AC | 1,880 ms
205,420 KB |
testcase_25 | AC | 1,843 ms
205,048 KB |
testcase_26 | AC | 1,054 ms
203,884 KB |
testcase_27 | AC | 1,010 ms
198,648 KB |
testcase_28 | AC | 228 ms
109,772 KB |
testcase_29 | AC | 283 ms
109,972 KB |
testcase_30 | AC | 305 ms
109,004 KB |
testcase_31 | AC | 195 ms
109,992 KB |
testcase_32 | AC | 352 ms
110,092 KB |
testcase_33 | AC | 325 ms
109,940 KB |
testcase_34 | AC | 203 ms
110,020 KB |
testcase_35 | AC | 226 ms
110,372 KB |
testcase_36 | AC | 225 ms
109,216 KB |
testcase_37 | AC | 284 ms
109,128 KB |
testcase_38 | AC | 1,540 ms
147,104 KB |
testcase_39 | AC | 913 ms
115,200 KB |
testcase_40 | AC | 1,908 ms
200,848 KB |
testcase_41 | AC | 1,238 ms
119,080 KB |
testcase_42 | AC | 1,521 ms
145,160 KB |
testcase_43 | AC | 1,380 ms
129,604 KB |
testcase_44 | AC | 1,693 ms
168,776 KB |
testcase_45 | AC | 1,709 ms
162,572 KB |
testcase_46 | AC | 1,410 ms
139,164 KB |
testcase_47 | AC | 1,557 ms
154,528 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 = list(map(int, readline().split())) Q = int(readline()) m = map(int, read().split()) query = zip(m, m, m) main(X, query)