結果
問題 | No.1332 Range Nearest Query |
ユーザー | mkawa2 |
提出日時 | 2021-01-09 18:48:05 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 4,073 bytes |
コンパイル時間 | 1,430 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 181,108 KB |
最終ジャッジ日時 | 2024-04-29 07:38:45 |
合計ジャッジ時間 | 29,972 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 72 ms
67,328 KB |
testcase_01 | AC | 72 ms
67,712 KB |
testcase_02 | AC | 75 ms
67,712 KB |
testcase_03 | AC | 2,284 ms
158,736 KB |
testcase_04 | AC | 2,263 ms
158,160 KB |
testcase_05 | AC | 2,220 ms
158,420 KB |
testcase_06 | AC | 1,149 ms
171,368 KB |
testcase_07 | AC | 1,160 ms
171,240 KB |
testcase_08 | AC | 1,173 ms
173,800 KB |
testcase_09 | AC | 1,149 ms
171,372 KB |
testcase_10 | AC | 1,165 ms
171,756 KB |
testcase_11 | AC | 1,147 ms
173,540 KB |
testcase_12 | AC | 1,154 ms
172,032 KB |
testcase_13 | AC | 1,160 ms
173,536 KB |
testcase_14 | AC | 1,153 ms
171,368 KB |
testcase_15 | AC | 1,162 ms
171,560 KB |
testcase_16 | AC | 2,486 ms
174,924 KB |
testcase_17 | TLE | - |
testcase_18 | TLE | - |
testcase_19 | TLE | - |
testcase_20 | TLE | - |
testcase_21 | TLE | - |
testcase_22 | TLE | - |
testcase_23 | TLE | - |
testcase_24 | TLE | - |
testcase_25 | TLE | - |
testcase_26 | AC | 712 ms
169,532 KB |
testcase_27 | AC | 709 ms
171,800 KB |
testcase_28 | AC | 508 ms
98,896 KB |
testcase_29 | AC | 509 ms
99,288 KB |
testcase_30 | AC | 525 ms
100,188 KB |
testcase_31 | AC | 443 ms
98,652 KB |
testcase_32 | AC | 542 ms
100,132 KB |
testcase_33 | AC | 540 ms
99,868 KB |
testcase_34 | AC | 471 ms
99,408 KB |
testcase_35 | AC | 499 ms
99,032 KB |
testcase_36 | AC | 494 ms
98,776 KB |
testcase_37 | AC | 506 ms
99,536 KB |
testcase_38 | AC | 1,535 ms
137,308 KB |
testcase_39 | AC | 771 ms
101,652 KB |
testcase_40 | AC | 2,454 ms
172,928 KB |
testcase_41 | AC | 1,059 ms
108,392 KB |
testcase_42 | AC | 1,525 ms
135,404 KB |
testcase_43 | AC | 1,240 ms
120,180 KB |
testcase_44 | AC | 2,086 ms
151,672 KB |
testcase_45 | AC | 1,968 ms
145,504 KB |
testcase_46 | AC | 1,409 ms
128,032 KB |
testcase_47 | AC | 1,658 ms
144,932 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() 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")