#994162 (C++23) No.2804 Fixer And Ratism

• 問題: No.2804 Fixer And Ratism
• ユーザー: Kude
• 提出日時: 2024-07-12 21:46:48
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 30 ms / 2,000 ms
• コード長: 1,827 bytes
• コンパイル時間: 4,464 ms
• コンパイル使用メモリ: 295,696 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-12 21:46:55
• 合計ジャッジ時間: 5,663 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

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

ソースコード

#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  map<int, string> name;
  map<string, int> rating;
  set<int> booted, not_booted;
  rep(_, q) {
    int type;
    cin >> type;
    if (type == 1) {
      string s;
      int r;
      cin >> s >> r;
      name[r] = s;
      rating[s] = r;
      not_booted.emplace(r);
    } else if (type == 2) {
      int x;
      cin >> x;
      n -= x;
    } else {
      string s;
      int x;
      cin >> s >> x;
      n += x;
      int r = rating[s];
      auto [it, ok] = booted.emplace(r);
      if (ok) not_booted.erase(r);
    }
    static VI bye;
    bye.clear();
    while (n < ssize(booted) + ssize(not_booted) && not_booted.size()) {
      auto it = not_booted.begin();
      bye.emplace_back(*it);
      not_booted.erase(it);
    }
    int c = bye.size();
    while (n < ssize(booted)) {
      auto it = booted.begin();
      bye.emplace_back(*it);
      booted.erase(it);
    }
    inplace_merge(bye.begin(), bye.begin() + c, bye.end());
    for (int r : bye) {
      cout << name[r] << '\n';
    }
  }
}