#781371 (PyPy3) No.649 ここでちょっとQK！

提出ソース
結果

問題	No.649 ここでちょっとQK！
ユーザー	Kohno
提出日時	2022-07-24 22:24:00
言語	PyPy3 (7.3.15)
結果	WA
実行時間	-
コード長	5,560 bytes
コンパイル時間	202 ms
コンパイル使用メモリ	82,588 KB
実行使用メモリ	181,716 KB
最終ジャッジ日時	2024-07-06 17:41:51
合計ジャッジ時間	12,084 ms
ジャッジサーバーID （参考情報）	judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
sample	AC * 4
other	AC * 28 WA * 4
権限があれば一括ダウンロードができます
ソースコード

raw source code
プレゼンテーションモードにする

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
class SegmentTree(object):
    def __init__(self, v, op, e):
        self._n = len(v)
        self.op = op
        self.e = e
        self.log = SegmentTree._ceil_pow2(self._n)
        self.size = 1 << self.log
        self.d = [self.e] * 2 * self.size
        for i in range(self._n):
            self.d[self.size + i] = v[i]
        for i in range(self.size - 1, 0, -1):
            self._update(i)
    @staticmethod
    def _ceil_pow2(n):
        for x in range(64):
            if 1 << x >= n:
                break
        return x
    def _update(self, k):
        self.d[k] = self.op(self.d[2 * k], self.d[2 * k + 1])
    def __getitem__(self, p):
        assert 0 <= p < self._n
        return self.d[p + self.size]
    def __setitem__(self, p, x):
        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 __str__(self):
        return str(self.d[self.size:])
    def query(self, l, r):
        if l is ...:
            l = 0
        if r is ...:
            r = self._n
        assert 0 <= l <= 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 max_right(self, l, f):
        if l is ...:
            l = 0
        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 & 1 == 0:
                l >>= 1
            if not f(self.op(sm, self.d[l])):
                while l < self.size:
                    l <<= 1
                    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:
                break
        return self._n
    def min_left(self, r, f):
        if r is ...:
            r = self._n
        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 & 1:
                r >>= 1
            if not f(self.op(self.d[r], sm)):
                while r < self.size:
                    r <<= 1
                    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:
                break
        return 0
class _CountOrItem(object):
    def __init__(self, _tree_map):
        self._tree = _tree_map._tree
        self._g = _tree_map._g
    def _bind(self, l, r):
        self._l = l
        self._r = r
    def _predicate(self, s):
        return s < self._tree.query(self._l, self._r)
    def count(self):
        return self._tree.query(self._l, self._r)
    def item(self):
        try:
            if self._l is ...:
                i = self._tree.max_right(..., self._predicate)
            else:
                i = self._tree.min_left(..., self._predicate) - 1
        except AssertionError:
            return None
        return self._g[i] if 0 <= i < len(self._g) else None
from operator import add
class LimitedTreeMap(object):
    def __init__(self, domain):
        self._g = sorted(set(domain))
        self._f = {v: k for k, v in enumerate(self._g)}
        self._tree = SegmentTree([0] * len(self._g), add, 0)
        self._count_or_item = _CountOrItem(self)
    def __setitem__(self, p, x):
        p = self._f[p]
        self._tree[p] = x
    def __getitem__(self, p):
        p = self._f[p]
        return self._tree[p]
    def __str__(self):
        return str({v: self._tree[k] for v, k in self._f.items() if self._tree[k]})
    def __repr__(self):
        return str({v: self._tree[k] for v, k in self._f.items() if self._tree[k]})
    def __lt__(self, p):
        p = self._f[p]
        self._count_or_item._bind(..., p)
        return self._count_or_item
    def __le__(self, p):
        p = self._f[p]
        self._count_or_item._bind(..., p + 1)
        return self._count_or_item
    def __gt__(self, p):
        p = self._f[p]
        self._count_or_item._bind(p + 1, ...)
        return self._count_or_item
    def __ge__(self, p):
        p = self._f[p]
        self._count_or_item._bind(p, ...)
        return self._count_or_item
    def k_smallest(self, k):
        i = self._tree.max_right(..., lambda s: s < k + 1)
        return self._g[i] if 0 <= i < len(self._g) else None
    def k_largest(self, k):
        i = self._tree.min_left(..., lambda s: s < k + 1) - 1
        return self._g[i] if 0 <= i < len(self._g) else None
q, k = map(int, input().split())
domain = []
queries = []
for _ in range(q):
    t, *args = map(int, input().split())
    if t == 1:
        domain.append(*args)
    queries.append((t, *args))
tree_map = LimitedTreeMap(domain)
for t, *args in queries:
    if t == 1:
        x, = args
        tree_map[x] += 1
    else:
        x = tree_map.k_smallest(k - 1) or -1
        if x >= 0:
            tree_map[x] -= 1
        print(x)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
yukicoder

結果

ソースコード
