結果
問題 | No.1332 Range Nearest Query |
ユーザー | penguinman |
提出日時 | 2021-01-08 19:27:32 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,578 ms / 2,500 ms |
コード長 | 3,828 bytes |
コンパイル時間 | 168 ms |
コンパイル使用メモリ | 82,180 KB |
実行使用メモリ | 170,968 KB |
最終ジャッジ日時 | 2024-04-27 20:26:53 |
合計ジャッジ時間 | 45,469 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
69,628 KB |
testcase_01 | AC | 58 ms
68,972 KB |
testcase_02 | AC | 54 ms
68,388 KB |
testcase_03 | AC | 1,433 ms
158,320 KB |
testcase_04 | AC | 1,398 ms
158,460 KB |
testcase_05 | AC | 1,379 ms
158,188 KB |
testcase_06 | AC | 803 ms
166,476 KB |
testcase_07 | AC | 798 ms
166,692 KB |
testcase_08 | AC | 820 ms
166,732 KB |
testcase_09 | AC | 796 ms
166,616 KB |
testcase_10 | AC | 798 ms
166,732 KB |
testcase_11 | AC | 798 ms
166,608 KB |
testcase_12 | AC | 799 ms
166,668 KB |
testcase_13 | AC | 821 ms
166,600 KB |
testcase_14 | AC | 812 ms
165,776 KB |
testcase_15 | AC | 816 ms
166,732 KB |
testcase_16 | AC | 1,578 ms
170,184 KB |
testcase_17 | AC | 1,522 ms
170,548 KB |
testcase_18 | AC | 1,529 ms
170,444 KB |
testcase_19 | AC | 1,527 ms
170,704 KB |
testcase_20 | AC | 1,548 ms
170,828 KB |
testcase_21 | AC | 1,551 ms
170,824 KB |
testcase_22 | AC | 1,551 ms
170,968 KB |
testcase_23 | AC | 1,540 ms
170,324 KB |
testcase_24 | AC | 1,514 ms
170,448 KB |
testcase_25 | AC | 1,523 ms
170,068 KB |
testcase_26 | AC | 558 ms
160,636 KB |
testcase_27 | AC | 593 ms
169,076 KB |
testcase_28 | AC | 281 ms
94,536 KB |
testcase_29 | AC | 300 ms
93,816 KB |
testcase_30 | AC | 310 ms
94,584 KB |
testcase_31 | AC | 232 ms
94,028 KB |
testcase_32 | AC | 320 ms
94,880 KB |
testcase_33 | AC | 318 ms
94,184 KB |
testcase_34 | AC | 269 ms
94,356 KB |
testcase_35 | AC | 293 ms
94,500 KB |
testcase_36 | AC | 288 ms
93,960 KB |
testcase_37 | AC | 288 ms
94,300 KB |
testcase_38 | AC | 977 ms
141,380 KB |
testcase_39 | AC | 453 ms
96,068 KB |
testcase_40 | AC | 1,512 ms
170,504 KB |
testcase_41 | AC | 635 ms
105,344 KB |
testcase_42 | AC | 977 ms
143,628 KB |
testcase_43 | AC | 746 ms
117,208 KB |
testcase_44 | AC | 1,175 ms
140,656 KB |
testcase_45 | AC | 1,115 ms
143,428 KB |
testcase_46 | AC | 920 ms
135,276 KB |
testcase_47 | AC | 1,089 ms
147,192 KB |
ソースコード
# Refernce: https://github.com/Mitarushi/ACL-Python from typing import Callable, TypeVar, List T = TypeVar('T') class SegTree: def __init__(self, v: List[T], op: Callable[[T, T], T], e: Callable[[], T]) -> None: self._n = len(v) self.log = (self._n - 1).bit_length() self.size = 1 << self.log self.d = [e() for _ in range(2 * self.size)] self.op = op self.e = e for i in range(self._n): self.d[self.size + i] = v[i] for i in reversed(range(1, self.size)): self.__update__(i) @classmethod def init_e(cls, n: int, op: Callable[[T, T], T], e: Callable[[], T]) -> 'SegTree': return cls([e() for _ in range(n)], op, e) def set(self, p: int, x: T) -> 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) -> T: assert 0 <= p < self._n return self.d[p + self.size] def prod(self, l: int, r: int) -> T: assert 0 <= l <= self._n and 0 <= r <= self._n sml = self.e() smr = self.e() l += self.size r += self.size while l < r: if l & 1: sml = self.op(sml, self.d[l]) l += 1 if r & 1: r -= 1 smr = self.op(self.d[r], smr) l >>= 1 r >>= 1 return self.op(sml, smr) def all_prod(self) -> T: return self.d[1] def max_right(self, l: int, f: Callable[[T], bool]): assert 0 <= l <= self._n assert f(self.e()) if l == self._n: return self._n l += self.size sm = self.e() while True: while l % 2 == 0: l >>= 1 if not f(self.op(sm, self.d[l])): while l < self.size: l *= 2 if f(self.op(sm, self.d[l])): sm = self.op(sm, self.d[l]) l += 1 return l - self.size sm = self.op(sm, self.d[l]) l += 1 if (l & -l) == l: return self._n def min_left(self, r: int, f: Callable[[T], bool]): assert 0 <= r <= self._n assert f(self.e()) if r == 0: return 0 r += self.size sm = self.e() while True: r -= 1 while r > 1 and r % 2: r >>= 1 if not f(self.op(self.d[r], sm)): while r < self.size: r = 2 * r + 1 if f(self.op(self.d[r], sm)): sm = self.op(self.d[r], sm) r -= 1 return r + 1 - self.size sm = self.op(self.d[r], sm) if (r & -r) == r: return 0 def __update__(self, k: int) -> None: self.d[k] = self.op(self.d[2 * k], self.d[2 * k + 1]) import sys input=sys.stdin.readline inf=int(1e9) #入力 N=int(input()) X=list(map(int,input().split())) Q=int(input()) l=[0]*Q r=[0]*Q x=[0]*Q for i in range(Q): l[i],r[i],x[i]=map(int,input().split()) #sort data=[[]for i in range(N+Q)] for i in range(N): data[i]=[X[i],i] for i in range(Q): data[i+N]=[x[i],i+N] data.sort(key=lambda val:val[0]) #本題 ans=[inf]*Q seg=SegTree([-inf]*N,max,lambda: -inf) for i in data: if i[1]<N: seg.set(i[1],i[0]) else: index=i[1]-N ans[index]=x[index]-seg.prod(l[index]-1,r[index]) seg=SegTree([2*inf]*N,min,lambda: 2*inf) for i in data[::-1]: if i[1]<N: seg.set(i[1],i[0]) else: index=i[1]-N ans[index]=min(ans[index],seg.prod(l[index]-1,r[index])-x[index]) for i in ans: print(i)