結果
問題 | No.1332 Range Nearest Query |
ユーザー | maspy |
提出日時 | 2021-01-08 23:12:33 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,981 ms / 2,500 ms |
コード長 | 1,562 bytes |
コンパイル時間 | 240 ms |
コンパイル使用メモリ | 82,688 KB |
実行使用メモリ | 206,020 KB |
最終ジャッジ日時 | 2024-04-28 05:12:29 |
合計ジャッジ時間 | 59,327 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 35 ms
52,224 KB |
testcase_01 | AC | 36 ms
52,608 KB |
testcase_02 | AC | 37 ms
52,352 KB |
testcase_03 | AC | 1,902 ms
180,328 KB |
testcase_04 | AC | 1,852 ms
179,892 KB |
testcase_05 | AC | 1,890 ms
180,848 KB |
testcase_06 | AC | 932 ms
197,924 KB |
testcase_07 | AC | 1,018 ms
198,452 KB |
testcase_08 | AC | 917 ms
197,984 KB |
testcase_09 | AC | 932 ms
198,056 KB |
testcase_10 | AC | 923 ms
198,184 KB |
testcase_11 | AC | 917 ms
197,760 KB |
testcase_12 | AC | 936 ms
198,640 KB |
testcase_13 | AC | 949 ms
198,048 KB |
testcase_14 | AC | 924 ms
197,924 KB |
testcase_15 | AC | 1,039 ms
197,736 KB |
testcase_16 | AC | 1,899 ms
204,332 KB |
testcase_17 | AC | 1,981 ms
205,852 KB |
testcase_18 | AC | 1,953 ms
205,868 KB |
testcase_19 | AC | 1,900 ms
205,100 KB |
testcase_20 | AC | 1,951 ms
204,972 KB |
testcase_21 | AC | 1,934 ms
206,020 KB |
testcase_22 | AC | 1,910 ms
204,328 KB |
testcase_23 | AC | 1,942 ms
205,472 KB |
testcase_24 | AC | 1,944 ms
205,736 KB |
testcase_25 | AC | 1,902 ms
205,312 KB |
testcase_26 | AC | 1,241 ms
203,696 KB |
testcase_27 | AC | 1,059 ms
198,948 KB |
testcase_28 | AC | 228 ms
109,704 KB |
testcase_29 | AC | 297 ms
110,336 KB |
testcase_30 | AC | 319 ms
109,440 KB |
testcase_31 | AC | 193 ms
109,952 KB |
testcase_32 | AC | 362 ms
109,440 KB |
testcase_33 | AC | 365 ms
109,824 KB |
testcase_34 | AC | 224 ms
109,952 KB |
testcase_35 | AC | 248 ms
110,336 KB |
testcase_36 | AC | 250 ms
109,952 KB |
testcase_37 | AC | 298 ms
108,928 KB |
testcase_38 | AC | 1,554 ms
146,844 KB |
testcase_39 | AC | 1,004 ms
115,328 KB |
testcase_40 | AC | 1,963 ms
200,968 KB |
testcase_41 | AC | 1,299 ms
119,040 KB |
testcase_42 | AC | 1,591 ms
145,300 KB |
testcase_43 | AC | 1,442 ms
129,748 KB |
testcase_44 | AC | 1,744 ms
168,508 KB |
testcase_45 | AC | 1,771 ms
162,484 KB |
testcase_46 | AC | 1,477 ms
139,028 KB |
testcase_47 | AC | 1,610 ms
154,276 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)