結果
問題 | No.1332 Range Nearest Query |
ユーザー | maspy |
提出日時 | 2021-01-08 22:59:27 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,217 ms / 2,500 ms |
コード長 | 1,570 bytes |
コンパイル時間 | 528 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 226,064 KB |
最終ジャッジ日時 | 2024-04-28 04:44:06 |
合計ジャッジ時間 | 58,987 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
52,864 KB |
testcase_01 | AC | 37 ms
52,480 KB |
testcase_02 | AC | 36 ms
52,736 KB |
testcase_03 | AC | 1,840 ms
210,468 KB |
testcase_04 | AC | 1,784 ms
209,940 KB |
testcase_05 | AC | 1,832 ms
210,384 KB |
testcase_06 | AC | 920 ms
218,164 KB |
testcase_07 | AC | 942 ms
218,172 KB |
testcase_08 | AC | 913 ms
218,424 KB |
testcase_09 | AC | 933 ms
217,904 KB |
testcase_10 | AC | 922 ms
217,952 KB |
testcase_11 | AC | 965 ms
218,376 KB |
testcase_12 | AC | 940 ms
218,424 KB |
testcase_13 | AC | 917 ms
218,684 KB |
testcase_14 | AC | 926 ms
218,252 KB |
testcase_15 | AC | 910 ms
217,792 KB |
testcase_16 | AC | 1,876 ms
224,904 KB |
testcase_17 | AC | 1,943 ms
225,980 KB |
testcase_18 | AC | 1,942 ms
225,712 KB |
testcase_19 | AC | 1,921 ms
225,148 KB |
testcase_20 | AC | 1,967 ms
226,064 KB |
testcase_21 | AC | 2,217 ms
225,860 KB |
testcase_22 | AC | 1,852 ms
225,216 KB |
testcase_23 | AC | 1,922 ms
225,076 KB |
testcase_24 | AC | 1,951 ms
225,780 KB |
testcase_25 | AC | 1,902 ms
225,220 KB |
testcase_26 | AC | 1,061 ms
223,168 KB |
testcase_27 | AC | 1,066 ms
219,316 KB |
testcase_28 | AC | 270 ms
108,928 KB |
testcase_29 | AC | 320 ms
109,312 KB |
testcase_30 | AC | 343 ms
109,184 KB |
testcase_31 | AC | 222 ms
109,312 KB |
testcase_32 | AC | 380 ms
109,696 KB |
testcase_33 | AC | 346 ms
108,928 KB |
testcase_34 | AC | 236 ms
109,440 KB |
testcase_35 | AC | 264 ms
109,692 KB |
testcase_36 | AC | 263 ms
109,312 KB |
testcase_37 | AC | 316 ms
109,312 KB |
testcase_38 | AC | 1,530 ms
160,748 KB |
testcase_39 | AC | 942 ms
114,076 KB |
testcase_40 | AC | 1,924 ms
221,544 KB |
testcase_41 | AC | 1,269 ms
131,580 KB |
testcase_42 | AC | 1,575 ms
159,372 KB |
testcase_43 | AC | 1,412 ms
142,108 KB |
testcase_44 | AC | 1,768 ms
196,168 KB |
testcase_45 | AC | 1,734 ms
176,612 KB |
testcase_46 | AC | 1,457 ms
153,708 KB |
testcase_47 | AC | 1,596 ms
168,004 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 = tuple(zip(m, m, m)) main(X, query)