This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub Rin204/Library-Python
# verification-helper: PROBLEM https://yukicoder.me/problems/no/649 from pathlib import Path import sys sys.path.append(str(Path(__file__).resolve().parent.parent.parent.parent)) from random import randrange class SegmentTreeBase_: def ope(self, l, r): return None def e(self): return None def __init__(self, n, init=None): self.n = n self.n0 = 1 << (n - 1).bit_length() self.data = [self.e()] * (2 * self.n0) if init is not None: for i in range(n): self.data[self.n0 + i] = init[i] for i in range(self.n0 - 1, 0, -1): self.data[i] = self.ope(self.data[2 * i], self.data[2 * i + 1]) def build(self): for i in range(self.n0 - 1, 0, -1): self.data[i] = self.ope(self.data[2 * i], self.data[2 * i + 1]) def set(self, i, x): i += self.n0 self.data[i] = x while i > 1: i >>= 1 self.data[i] = self.ope(self.data[2 * i], self.data[2 * i + 1]) def get(self, i): return self.data[i + self.n0] def __getitem__(self, i): return self.data[i + self.n0] def __setitem__(self, i, x): self.set(i, x) def prod(self, l, r): assert 0 <= l <= r <= self.n0 l += self.n0 r += self.n0 lles = self.e() rres = self.e() while l < r: if l & 1: lles = self.ope(lles, self.data[l]) l += 1 if r & 1: r -= 1 rres = self.ope(self.data[r], rres) l >>= 1 r >>= 1 return self.ope(lles, rres) def max_right(self, l, f): if l == self.n: return self.n l += self.n0 sm = self.e() while 1: while l % 2 == 0: l >>= 1 if not f(self.ope(sm, self.data[l])): while l < self.n0: l <<= 1 if f(self.ope(sm, self.data[l])): sm = self.ope(sm, self.data[l]) l += 1 return l - self.n0 sm = self.ope(sm, self.data[l]) l += 1 if l & -l == l: break return self.n def min_left(self, r, f): if r == 0: return 0 r += self.n0 sm = self.e() while 1: r -= 1 while r > 1 and r % 2: r >>= 1 if not f(self.ope(self.data[r], sm)): while r < self.n0: r = 2 * r + 1 if f(self.ope(self.data[r], sm)): sm = self.ope(self.data[r], sm) r -= 1 return r + 1 - self.n0 sm = self.ope(self.data[r], sm) if r & -r == r: break return 0 class PointAddRangeSum(SegmentTreeBase_): def ope(self, l, r): return l + r def e(self): return 0 Q, k = map(int, input().split()) Query = [] X = [] for _ in range(Q): query = list(map(int, input().split())) if query[0] == 1: X.append(query[1]) Query.append(query[1]) else: Query.append(-1) X = sorted(set(X)) # 二分探索のテスト用 add = randrange(100) rev = randrange(2) X = [-1] * add + X if rev: X = X[::-1] dic = {x: i for i, x in enumerate(X)} seg = PointAddRangeSum(len(X)) if not rev: for q in Query: if q == -1: p = seg.max_right(add, lambda x: x < k) if p == len(X): print(-1) else: print(X[p]) seg[p] = seg[p] - 1 else: seg[dic[q]] = seg[dic[q]] + 1 else: for q in Query: if q == -1: p = seg.min_left(len(X) - add, lambda x: x < k) - 1 if p == -1: print(-1) else: print(X[p]) seg[p] = seg[p] - 1 else: seg[dic[q]] = seg[dic[q]] + 1
Traceback (most recent call last): File "/opt/hostedtoolcache/Python/3.11.4/x64/lib/python3.11/site-packages/onlinejudge_verify/documentation/build.py", line 81, in _render_source_code_stat bundled_code = language.bundle( ^^^^^^^^^^^^^^^^ File "/opt/hostedtoolcache/Python/3.11.4/x64/lib/python3.11/site-packages/onlinejudge_verify/languages/python.py", line 108, in bundle raise NotImplementedError NotImplementedError