結果
問題 | No.1332 Range Nearest Query |
ユーザー |
![]() |
提出日時 | 2023-11-15 12:19:16 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 5,652 bytes |
コンパイル時間 | 207 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 124,416 KB |
最終ジャッジ日時 | 2024-09-26 04:35:02 |
合計ジャッジ時間 | 6,103 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 3 TLE * 1 -- * 44 |
ソースコード
import sysinput = sys.stdin.readline# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.pyimport mathfrom bisect import bisect_left, bisect_rightfrom typing import Generic, Iterable, Iterator, TypeVar, Union, ListT = TypeVar('T')class SortedSet(Generic[T]):BUCKET_RATIO = 50REBUILD_RATIO = 170def _build(self, a=None) -> None:"Evenly divide `a` into buckets."if a is None:a = list(self)size = self.size = len(a)bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))self.a = [a[size * i // bucket_size: size *(i + 1) // bucket_size] for i in range(bucket_size)]def __init__(self, a: Iterable[T] = []) -> None:"Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"a = list(a)if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):a = sorted(set(a))self._build(a)def __iter__(self) -> Iterator[T]:for i in self.a:for j in i:yield jdef __reversed__(self) -> Iterator[T]:for i in reversed(self.a):for j in reversed(i):yield jdef __len__(self) -> int:return self.sizedef __repr__(self) -> str:return "SortedSet" + str(self.a)def __str__(self) -> str:s = str(list(self))return "{" + s[1: len(s) - 1] + "}"def _find_bucket(self, x: T) -> List[T]:"Find the bucket which should contain x. self must not be empty."for a in self.a:if x <= a[-1]:return areturn adef __contains__(self, x: T) -> bool:if self.size == 0:return Falsea = self._find_bucket(x)i = bisect_left(a, x)return i != len(a) and a[i] == xdef add(self, x: T) -> bool:"Add an element and return True if added. / O(√N)"if self.size == 0:self.a = [[x]]self.size = 1return Truea = self._find_bucket(x)i = bisect_left(a, x)if i != len(a) and a[i] == x:return Falsea.insert(i, x)self.size += 1if len(a) > len(self.a) * self.REBUILD_RATIO:self._build()return Truedef discard(self, x: T) -> bool:"Remove an element and return True if removed. / O(√N)"if self.size == 0:return Falsea = self._find_bucket(x)i = bisect_left(a, x)if i == len(a) or a[i] != x:return Falsea.pop(i)self.size -= 1if len(a) == 0:self._build()return Truedef lt(self, x: T) -> Union[T, None]:"Find the largest element < x, or None if it doesn't exist."for a in reversed(self.a):if a[0] < x:return a[bisect_left(a, x) - 1]def le(self, x: T) -> Union[T, None]:"Find the largest element <= x, or None if it doesn't exist."for a in reversed(self.a):if a[0] <= x:return a[bisect_right(a, x) - 1]def gt(self, x: T) -> Union[T, None]:"Find the smallest element > x, or None if it doesn't exist."for a in self.a:if a[-1] > x:return a[bisect_right(a, x)]def ge(self, x: T) -> Union[T, None]:"Find the smallest element >= x, or None if it doesn't exist."for a in self.a:if a[-1] >= x:return a[bisect_left(a, x)]def __getitem__(self, x: int) -> T:"Return the x-th element, or IndexError if it doesn't exist."if x < 0:x += self.sizeif x < 0:raise IndexErrorfor a in self.a:if x < len(a):return a[x]x -= len(a)raise IndexErrordef index(self, x: T) -> int:"Count the number of elements < x."ans = 0for a in self.a:if a[-1] >= x:return ans + bisect_left(a, x)ans += len(a)return ansdef index_right(self, x: T) -> int:"Count the number of elements <= x."ans = 0for a in self.a:if a[-1] > x:return ans + bisect_right(a, x)ans += len(a)return ans################################from math import sqrt, ceilM = 10 ** 9 + 5def encode(l, r, x, ind):return (r * N * M + l * M + x) * Q + inddef decode(v):ind = v % Qv //= Qx = v % Mv //= Mr, l = divmod(v, N)return l, r, x, indN = int(input())X = list(map(int, input().split()))Q = int(input())B = ceil(sqrt(Q))query = [[] for _ in range(N//B + 1)]for i in range(Q):l, r, x = map(int, input().split())l, r = l - 1 , r - 1query[l//B].append(encode(l, r, x, i))for i in range(N//B + 1):if i % 2:query[i].sort(reverse=True)else:query[i].sort()SS = SortedSet()inf = 10 ** 18SS.add(inf)SS.add(-inf)nowL, nowR = 0, 0SS.add(X[0])ans = [-1] * Qfor q in range(N//B + 1):for v in query[q]:l, r, x, ind = decode(v)while nowL < l:SS.discard(X[nowL])nowL += 1while nowL > l:nowL -= 1SS.add(X[nowL])while nowR < r:nowR += 1SS.add(X[nowR])while nowR > r:SS.discard(X[nowL])nowR -= 1u = SS.ge(x)d = SS.le(x)ans[ind] = min(u-x, x-d)for a in ans:print(a)