#993994 (C++17) No.2804 Fixer And Ratism

• 問題: No.2804 Fixer And Ratism
• ユーザー: Today03
• 提出日時: 2024-07-12 21:22:54
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 163 ms / 2,000 ms
• コード長: 2,004 bytes
• コンパイル時間: 3,330 ms
• コンパイル使用メモリ: 228,308 KB
• 最終ジャッジ日時: 2025-02-22 03:31:16
• ジャッジサーバーID （参考情報）: judge1 / judge1

ファイルパターン	結果
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
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;
int main() {
    int N, Q;
    cin >> N >> Q;
    map<string, int> rate;
    set<pair<int, string>> come, done;
    int nowp = N, nowh = 0;
    vector<string> ans;
    while (Q--) {
        int t;
        cin >> t;
        if (t == 1) {
            string s;
            int r;
            cin >> s >> r;
            rate[s] = r;
            come.insert({r, s});
            nowh++;
        }
        else if (t == 2) {
            int x;
            cin >> x;
            nowp -= x;
        }
        else {
            string s;
            int r;
            cin >> s >> r;
            come.erase({rate[s], s});
            done.insert({rate[s], s});
            nowp += r;
        }
        if (nowp < nowh) {
            vector<string> cont_d, cont_c;
            while (cont_d.size() < nowp && done.size() > 0) {
                auto [r, s] = *done.rbegin();
                done.erase({r, s});
                cont_d.push_back(s);
            }
            while (cont_d.size() + cont_c.size() < nowp && come.size() > 0) {
                auto [r, s] = *come.rbegin();
                come.erase({r, s});
                cont_c.push_back(s);
            }
            nowh = nowp;
            vector<pair<int, string>> other;
            for (auto [r, s] : done) {
                other.push_back({r, s});
            }
            for (auto [r, s] : come) {
                other.push_back({r, s});
            }
            sort(other.begin(), other.end());
            for (auto [r, s] : other) {
                ans.push_back(s);
            }
            done.clear();
            come.clear();
            for (string x : cont_d) {
                done.insert({rate[x], x});
            }
            for (string x : cont_c) {
                come.insert({rate[x], x});
            }
        }
    }
    for (string x : ans) {
        cout << x << endl;
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX