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

• 問題: No.2804 Fixer And Ratism
• ユーザー: ぷら
• 提出日時: 2024-07-12 22:28:37
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 30 ms / 2,000 ms
• コード長: 4,627 bytes
• コンパイル時間: 1,968 ms
• コンパイル使用メモリ: 160,524 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-12 22:28:42
• 合計ジャッジ時間: 4,396 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	11 ms; 5,376 KB
testcase_04	AC	8 ms; 5,376 KB
testcase_05	AC	4 ms; 5,376 KB
testcase_06	AC	21 ms; 5,376 KB
testcase_07	AC	7 ms; 5,376 KB
testcase_08	AC	8 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	6 ms; 5,376 KB
testcase_11	AC	16 ms; 5,376 KB
testcase_12	AC	17 ms; 5,376 KB
testcase_13	AC	5 ms; 5,376 KB
testcase_14	AC	15 ms; 5,376 KB
testcase_15	AC	4 ms; 5,376 KB
testcase_16	AC	16 ms; 5,376 KB
testcase_17	AC	7 ms; 5,376 KB
testcase_18	AC	23 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	4 ms; 5,376 KB
testcase_21	AC	21 ms; 5,376 KB
testcase_22	AC	3 ms; 5,376 KB
testcase_23	AC	30 ms; 5,376 KB
testcase_24	AC	23 ms; 5,376 KB
testcase_25	AC	27 ms; 5,376 KB
testcase_26	AC	27 ms; 5,376 KB
testcase_27	AC	25 ms; 5,376 KB
testcase_28	AC	26 ms; 5,376 KB
testcase_29	AC	25 ms; 5,376 KB
testcase_30	AC	28 ms; 5,376 KB
testcase_31	AC	25 ms; 5,376 KB
testcase_32	AC	26 ms; 5,376 KB
testcase_33	AC	2 ms; 5,376 KB

ソースコード

#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template <typename T> using vc = vector<T>;
template <typename T> using vvc = vector<vector<T>>;
template <typename T> using vvvc = vector<vector<vector<T>>>;
template<class T> using pq = priority_queue<T,vector<T>,greater<T>>;
template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }
template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }

int dx4[] = {1,0,-1,0};
int dy4[] = {0,1,0,-1};

#define overload5(a, b, c, d, e, name, ...) name
#define overload4(a, b, c, d, name, ...) name
#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)
#define REP1(i, n) for(ll i = 0; i < (n); ++i)
#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)
#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)
#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)
#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)
#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))
#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)
#define setbits(j, n) for(ll iiiii = (n), j = lowbit(iiiii); iiiii; iiiii ^= 1 << j, j = lowbit(iiiii))
#define perm(v) for(bool permrepflag = true; (permrepflag ? exchange(permrepflag, false) : next_permutation(all(v)));)
#define fi first
#define se second
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define drop(s) cout << #s << endl, exit(0)
#define si(c) (int)(c).size()
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define lbg(c, x) distance((c).begin(), lower_bound(all(c), (x), greater{}))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define ubg(c, x) distance((c).begin(), upper_bound(all(c), (x), greater{}))
#define rng(v, l, r) v.begin() + (l), v.begin() + (r)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define SORT(v) sort(all(v))
#define REV(v) reverse(all(v))
#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,q;
    cin >> n >> q;
    vc<pair<int,string>>res;
    set<string>st;
    while(q--) {
        int f;
        cin >> f;
        if(f == 1) {
            string s;
            int r;
            cin >> s >> r;
            res.pb({r,s});
        }
        if(f == 2) {
            int x;
            cin >> x;
            n -= x;
        }
        if(f == 3) {
            string s;
            int x;
            cin >> s >> x;
            st.insert(s);
            n += x;
        }
        if(n < si(res)) {
            SORT(res);
            REV(res);
            vc<string>ans;
            for(auto i:res) {
                if(st.count(i.se)) {
                    ans.pb(i.se);
                }
            }
            for(auto i:res) {
                if(!st.count(i.se)) {
                    ans.pb(i.se);
                }
            }
            set<string>st;
            for(int i = n; i < si(ans); i++) {
                st.insert(ans[i]);
            }
            vc<pair<int,string>>tmp;
            vc<pair<int,string>>nxt;
            for(int i = 0; i < si(res); i++) {
                if(st.count(res[i].se)) {
                    tmp.pb(res[i]);
                }
                else {
                    nxt.pb(res[i]);
                }
            }
            res = nxt;
            SORT(tmp);
            for(int i = 0; i < si(tmp); i++) {
                cout << tmp[i].se << "\n";
            }
        }
    }
}