src/$tests/data_structure/segtree_bisect.test.py

View this file on GitHub
Last update: 2023-07-23 08:45:17+09:00
Problem: https://yukicoder.me/problems/no/649
Link: View error logs on GitHub Actions

Depends on

src/data_structure/SegmentTree.py

Code

# 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
from src.data_structure.SegmentTree import SegmentTree

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)}


def ope(l, r):
    return l + r


seg = SegmentTree(len(X), ope, 0)
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