結果
問題 | No.1332 Range Nearest Query |
ユーザー | penguinman |
提出日時 | 2021-01-08 19:08:28 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,540 ms / 2,500 ms |
コード長 | 3,944 bytes |
コンパイル時間 | 128 ms |
コンパイル使用メモリ | 82,456 KB |
実行使用メモリ | 168,044 KB |
最終ジャッジ日時 | 2024-04-27 19:58:19 |
合計ジャッジ時間 | 45,268 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
68,288 KB |
testcase_01 | AC | 57 ms
68,216 KB |
testcase_02 | AC | 60 ms
68,580 KB |
testcase_03 | AC | 1,348 ms
155,376 KB |
testcase_04 | AC | 1,340 ms
155,652 KB |
testcase_05 | AC | 1,348 ms
155,736 KB |
testcase_06 | AC | 769 ms
161,984 KB |
testcase_07 | AC | 777 ms
163,548 KB |
testcase_08 | AC | 776 ms
161,668 KB |
testcase_09 | AC | 774 ms
163,840 KB |
testcase_10 | AC | 776 ms
163,764 KB |
testcase_11 | AC | 759 ms
163,748 KB |
testcase_12 | AC | 765 ms
163,480 KB |
testcase_13 | AC | 773 ms
161,788 KB |
testcase_14 | AC | 784 ms
163,504 KB |
testcase_15 | AC | 763 ms
162,076 KB |
testcase_16 | AC | 1,471 ms
167,220 KB |
testcase_17 | AC | 1,484 ms
167,092 KB |
testcase_18 | AC | 1,525 ms
167,120 KB |
testcase_19 | AC | 1,540 ms
168,044 KB |
testcase_20 | AC | 1,524 ms
167,604 KB |
testcase_21 | AC | 1,509 ms
167,804 KB |
testcase_22 | AC | 1,520 ms
167,864 KB |
testcase_23 | AC | 1,466 ms
167,028 KB |
testcase_24 | AC | 1,532 ms
167,192 KB |
testcase_25 | AC | 1,503 ms
167,112 KB |
testcase_26 | AC | 528 ms
157,132 KB |
testcase_27 | AC | 537 ms
165,924 KB |
testcase_28 | AC | 301 ms
93,984 KB |
testcase_29 | AC | 335 ms
93,848 KB |
testcase_30 | AC | 336 ms
93,652 KB |
testcase_31 | AC | 243 ms
93,180 KB |
testcase_32 | AC | 347 ms
94,912 KB |
testcase_33 | AC | 344 ms
93,980 KB |
testcase_34 | AC | 277 ms
93,460 KB |
testcase_35 | AC | 316 ms
93,784 KB |
testcase_36 | AC | 315 ms
93,504 KB |
testcase_37 | AC | 318 ms
93,592 KB |
testcase_38 | AC | 959 ms
138,756 KB |
testcase_39 | AC | 455 ms
95,176 KB |
testcase_40 | AC | 1,468 ms
167,048 KB |
testcase_41 | AC | 610 ms
104,848 KB |
testcase_42 | AC | 931 ms
141,724 KB |
testcase_43 | AC | 708 ms
114,916 KB |
testcase_44 | AC | 1,132 ms
138,252 KB |
testcase_45 | AC | 1,064 ms
141,028 KB |
testcase_46 | AC | 860 ms
133,424 KB |
testcase_47 | AC | 1,028 ms
144,808 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=[-1]*Q seg=SegTree([-1]*N,max,lambda: -1) for i in data: if i[1]<N: seg.set(i[1],i[0]) else: index=i[1]-N mem=seg.prod(l[index]-1,r[index]) if mem!=-1: ans[index]=x[index]-mem seg=SegTree([-1]*N,max,lambda: -1) for i in reversed(data): if i[1]<N: seg.set(i[1],inf-i[0]) else: index=i[1]-N mem=inf-seg.prod(l[index]-1,r[index]) if mem!=inf+1 and (ans[index]==-1 or ans[index]>mem-x[index]): ans[index]=mem-x[index] for i in ans: print(i)