#993958 (PyPy3) No.2804 Fixer And Ratism

• 問題: No.2804 Fixer And Ratism
• ユーザー: 👑 rin204
• 提出日時: 2024-07-12 21:17:09
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 157 ms / 2,000 ms
• コード長: 2,470 bytes
• コンパイル時間: 180 ms
• コンパイル使用メモリ: 82,512 KB
• 実行使用メモリ: 76,792 KB
• 最終ジャッジ日時: 2024-07-12 21:17:20
• 合計ジャッジ時間: 5,516 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 31

ソースコード

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
import heapq
class DeletableHeapq:
    def __init__(self, lst=None, reverse=False):
        if reverse:
            self.pm = -1
        else:
            self.pm = 1
        if lst is None:
            self.hq = []
        else:
            self.hq = [self.pm * x for x in lst]
        heapq.heapify(self.hq)
        self.tot = sum(self.hq) * self.pm
        self.cnt = {}
        for x in self.hq:
            self.cnt[x] = self.cnt.get(x, 0) + 1
        self.length = len(self.hq)
    def __bool__(self):
        return bool(self.hq)
    def __len__(self):
        return self.length
    @property
    def sum(self):
        return self.tot
    def top(self):
        if self.hq:
            return self.hq[0] * self.pm
        else:
            return None
    def __getitem__(self, i):
        # 先頭要素にアクセスしたいときのみ
        assert i == 0
        return self.top()
    def push(self, x):
        self.length += 1
        self.cnt[x * self.pm] = self.cnt.get(x * self.pm, 0) + 1
        self.tot += x
        heapq.heappush(self.hq, x * self.pm)
    def pop(self):
        if not self.hq:
            return None
        self.length -= 1
        x = heapq.heappop(self.hq)
        self.cnt[x] -= 1
        self.tot -= x * self.pm
        self._delete()
        return x * self.pm
    def remove(self, x):
        if self.cnt.get(x * self.pm, 0) == 0:
            return False
        self.length -= 1
        self.cnt[x * self.pm] -= 1
        self.tot -= x
        self._delete()
        return True
    def _delete(self):
        while self.hq and self.cnt.get(self.hq[0], 0) == 0:
            heapq.heappop(self.hq)
n, Q = map(int, input().split())
hq1 = DeletableHeapq()
hq2 = DeletableHeapq()
S = [""] * 4001
tf = [False] * 10000
dic = {}
for _ in range(Q):
    query = input().split()
    if query[0] == "1":
        s, r = query[1:]
        r = int(r)
        S[r] = s
        dic[s] = r
        hq1.push(r)
        tf[r] = True
    elif query[0] == "2":
        x = int(query[1])
        n -= x
    else:
        s, x = query[1:]
        x = int(x)
        n += x
        r = dic[s]
        if tf[r]:
            tf[r] = False
            hq1.remove(r)
            hq2.push(r)
    ans = []
    while n < len(hq1) + len(hq2):
        if hq1:
            r = hq1.pop()
            ans.append(r)
        else:
            r = hq2.pop()
            ans.append(r)
    ans.sort()
    for r in ans:
        print(S[r])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX