#721939 (PyPy3) No.618 labo-index

• 問題: No.618 labo-index
• ユーザー: mkawa2
• 提出日時: 2021-12-05 10:27:44
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 649 ms / 6,000 ms
• コード長: 2,470 bytes
• コンパイル時間: 137 ms
• コンパイル使用メモリ: 82,604 KB
• 実行使用メモリ: 122,008 KB
• 最終ジャッジ日時: 2024-07-07 07:04:11
• 合計ジャッジ時間: 12,727 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

ファイルパターン	結果
sample	AC * 4
other	AC * 35

ソースコード

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
import sys
sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = 18446744073709551615
inf = 4294967295
md = 10**9+7
# md = 998244353
class BitSum:
    def __init__(self, n):
        self.n = n+1
        self.table = [0]*self.n
    def add(self, i, x):
        i += 1
        while i < self.n:
            self.table[i] += x
            i += i & -i
    # [0,i]の和
    def sum(self, i):
        i += 1
        res = 0
        while i > 0:
            res += self.table[i]
            i -= i & -i
        return res
    # [l,r)の和
    def sumlr(self, l, r):
        if l >= r: return 0
        if l == 0: return self.sum(r-1)
        return self.sum(r-1)-self.sum(l-1)
    # 数列を度数分布とみたときに、x番目がどのインデックスにあるかを返す
    # xが大きすぎるときは配列の長さnを返す
    def rank(self, x):
        idx = 0
        for lv in range((self.n-1).bit_length()-1, -1, -1):
            mid = idx+(1 << lv)
            if mid >= self.n: continue
            if self.table[mid] < x:
                x -= self.table[mid]
                idx += 1 << lv
        return idx
q = II()
tx = LLI(q)
base = 0
xx = set()
for t, x in tx:
    if t == 1:
        xx.add(x-base)
    if t == 3:
        base += x
dec = sorted(xx, reverse=True)
enc = {a: i for i, a in enumerate(dec)}
def binary_search(l, r, ok, minimize):
    if minimize: l -= 1
    else: r += 1
    while l+1 < r:
        m = (l+r)//2
        if ok(m) ^ minimize: l = m
        else: r = m
    if minimize: return r
    return l
def ok(m):
    i = bit.rank(m)
    x = dec[i]+base
    return x >= m
base = 0
bit = BitSum(len(enc)+5)
ii = []
n = 0
for t, x in tx:
    if t == 1:
        x -= base
        i = enc[x]
        bit.add(i, 1)
        n += 1
        ii.append(i)
    if t == 2:
        i = ii[x-1]
        bit.add(i, -1)
        n -= 1
    if t == 3:
        base += x
    ans = binary_search(0, n, ok, False)
    print(ans)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX