結果
問題 | No.2804 Fixer And Ratism |
ユーザー |
![]() |
提出日時 | 2024-07-12 21:46:48 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.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 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 31 |
ソースコード
#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';}}}