結果
問題 | No.1332 Range Nearest Query |
ユーザー | mkawa2 |
提出日時 | 2021-01-09 18:55:57 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,056 ms / 2,500 ms |
コード長 | 4,090 bytes |
コンパイル時間 | 339 ms |
コンパイル使用メモリ | 86,940 KB |
実行使用メモリ | 173,744 KB |
最終ジャッジ日時 | 2023-08-11 15:43:26 |
合計ジャッジ時間 | 62,563 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 170 ms
80,328 KB |
testcase_01 | AC | 174 ms
80,560 KB |
testcase_02 | AC | 170 ms
80,544 KB |
testcase_03 | AC | 1,827 ms
161,140 KB |
testcase_04 | AC | 1,806 ms
159,884 KB |
testcase_05 | AC | 1,806 ms
159,464 KB |
testcase_06 | AC | 1,073 ms
168,864 KB |
testcase_07 | AC | 1,087 ms
169,296 KB |
testcase_08 | AC | 1,093 ms
168,968 KB |
testcase_09 | AC | 1,088 ms
169,020 KB |
testcase_10 | AC | 1,089 ms
168,996 KB |
testcase_11 | AC | 1,085 ms
168,896 KB |
testcase_12 | AC | 1,082 ms
169,372 KB |
testcase_13 | AC | 1,086 ms
169,040 KB |
testcase_14 | AC | 1,087 ms
169,364 KB |
testcase_15 | AC | 1,080 ms
169,020 KB |
testcase_16 | AC | 2,032 ms
172,132 KB |
testcase_17 | AC | 1,999 ms
171,176 KB |
testcase_18 | AC | 2,009 ms
172,384 KB |
testcase_19 | AC | 2,033 ms
171,312 KB |
testcase_20 | AC | 2,048 ms
171,704 KB |
testcase_21 | AC | 2,053 ms
172,080 KB |
testcase_22 | AC | 2,041 ms
171,504 KB |
testcase_23 | AC | 2,056 ms
173,744 KB |
testcase_24 | AC | 2,052 ms
171,748 KB |
testcase_25 | AC | 2,029 ms
171,528 KB |
testcase_26 | AC | 768 ms
168,160 KB |
testcase_27 | AC | 774 ms
170,524 KB |
testcase_28 | AC | 509 ms
103,800 KB |
testcase_29 | AC | 521 ms
104,352 KB |
testcase_30 | AC | 527 ms
103,032 KB |
testcase_31 | AC | 442 ms
102,972 KB |
testcase_32 | AC | 546 ms
104,352 KB |
testcase_33 | AC | 553 ms
104,568 KB |
testcase_34 | AC | 479 ms
103,324 KB |
testcase_35 | AC | 517 ms
103,664 KB |
testcase_36 | AC | 517 ms
104,188 KB |
testcase_37 | AC | 517 ms
104,780 KB |
testcase_38 | AC | 1,387 ms
144,760 KB |
testcase_39 | AC | 732 ms
107,108 KB |
testcase_40 | AC | 2,031 ms
173,272 KB |
testcase_41 | AC | 907 ms
116,656 KB |
testcase_42 | AC | 1,341 ms
145,144 KB |
testcase_43 | AC | 1,061 ms
125,704 KB |
testcase_44 | AC | 1,659 ms
154,720 KB |
testcase_45 | AC | 1,540 ms
149,752 KB |
testcase_46 | AC | 1,309 ms
138,308 KB |
testcase_47 | AC | 1,540 ms
146,460 KB |
ソースコード
import sys def II(): return int(sys.stdin.buffer.readline()) def MI(): return map(int, sys.stdin.buffer.readline().split()) def LI(): return list(map(int, sys.stdin.buffer.readline().split())) inf = 10**16 # md = 998244353 md = 10**9+7 import typing class SegTree: def __init__(self, op: typing.Callable[[typing.Any, typing.Any], typing.Any], e: typing.Any, v: typing.Union[int, typing.List[typing.Any]]) -> None: self._op = op self._e = e if isinstance(v, int): v = [e] * v self._n = len(v) self._log = (self._n-1).bit_length() self._size = 1 << self._log self._d = [e] * (2 * self._size) for i in range(self._n): self._d[self._size + i] = v[i] for i in range(self._size - 1, 0, -1): self._update(i) def set(self, p: int, x: typing.Any) -> None: assert 0 <= p < self._n p += self._size self._d[p] = x for i in range(1, self._log + 1): self._update(p >> i) def get(self, p: int) -> typing.Any: assert 0 <= p < self._n return self._d[p + self._size] def prod(self, left: int, right: int) -> typing.Any: assert 0 <= left <= right <= self._n sml = self._e smr = self._e left += self._size right += self._size while left < right: if left & 1: sml = self._op(sml, self._d[left]) left += 1 if right & 1: right -= 1 smr = self._op(self._d[right], smr) left >>= 1 right >>= 1 return self._op(sml, smr) def all_prod(self) -> typing.Any: return self._d[1] def max_right(self, left: int, f: typing.Callable[[typing.Any], bool]) -> int: assert 0 <= left <= self._n assert f(self._e) if left == self._n: return self._n left += self._size sm = self._e first = True while first or (left & -left) != left: first = False while left % 2 == 0: left >>= 1 if not f(self._op(sm, self._d[left])): while left < self._size: left *= 2 if f(self._op(sm, self._d[left])): sm = self._op(sm, self._d[left]) left += 1 return left - self._size sm = self._op(sm, self._d[left]) left += 1 return self._n def min_left(self, right: int, f: typing.Callable[[typing.Any], bool]) -> int: assert 0 <= right <= self._n assert f(self._e) if right == 0: return 0 right += self._size sm = self._e first = True while first or (right & -right) != right: first = False right -= 1 while right > 1 and right % 2: right >>= 1 if not f(self._op(self._d[right], sm)): while right < self._size: right = 2 * right + 1 if f(self._op(self._d[right], sm)): sm = self._op(self._d[right], sm) right -= 1 return right + 1 - self._size sm = self._op(self._d[right], sm) return 0 def _update(self, k: int) -> None: self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1]) n=II() xx=LI() q=II() task=[] lr=[] for i in range(q): l,r,x=MI() l-=1 lr.append((l,r)) task.append((x,1,i)) for j,x in enumerate(xx): task.append((x,0,j)) task.sort(key=lambda x:x[0]) ans=[-1]*q st=SegTree(max,-inf,n) for x,t,i in task: if t: l,r=lr[i] ans[i]=x-st.prod(l,r) else: st.set(i,x) st=SegTree(min,inf,n) for x,t,i in task[::-1]: if t: l,r=lr[i] cur=st.prod(l,r)-x if cur<ans[i]:ans[i]=cur else: st.set(i,x) print(*ans,sep="\n")