結果

問題 No.2804 Fixer And Ratism
ユーザー 👑 binap
提出日時 2024-07-12 22:17:32
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 203 ms / 2,000 ms
コード長 4,036 bytes
コンパイル時間 5,454 ms
コンパイル使用メモリ 324,844 KB
実行使用メモリ 13,672 KB
最終ジャッジ日時 2024-07-12 22:17:44
合計ジャッジ時間 9,833 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge6
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;
ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return 
    os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); 
    return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return 
    true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder
    ::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n 
    - 1 ? "\n" : " "); return os;}
template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}
struct Query{
    int type;
    string name;
    int number;
};
int main(){
    int n, q;
    cin >> n >> q;
    vector<Query> querys;
    rep(i, q){
        int type;
        string name;
        int number;
        cin >> type;
        if(type == 1) cin >> name >> number;
        if(type == 2) cin >> number;
        if(type == 3) cin >> name >> number;
        querys.emplace_back(type, name, number);
    }
    vector<string> names;
    vector<int> rates;
    for(auto query : querys){
        if(query.type == 1){
            names.push_back(query.name);
            rates.push_back(query.number);
        }
    }
    int m = names.size();
    
    vector<int> fixers;
    vector<int> takers;
    int k = 0;
    vector<string> home;
    
    auto check = [&]{
        sort(fixers.begin(), fixers.end(), [&](int left, int right){return rates[left] > rates[right];});
        sort(takers.begin(), takers.end(), [&](int left, int right){return rates[left] > rates[right];});
        int n_fixer = fixers.size();
        int n_taker = takers.size();
        vector<int> candidates;
        if(n < n_fixer){
            rep(i, n_fixer - n){
                candidates.push_back(fixers.back());
                fixers.pop_back();
            }
            rep(i, n_taker){
                candidates.push_back(takers.back());
                takers.pop_back();
            }
        }else if(n < n_fixer + n_taker){
            rep(i, n_taker - (n - n_fixer)){
                candidates.push_back(takers.back());
                takers.pop_back();
            }
        }
        sort(candidates.begin(), candidates.end(), [&](int left, int right){return rates[left] < rates[right];});
        for(auto idx : candidates) home.push_back(names[idx]);
    };
    
    for(auto query : querys){
        if(query.type == 1){
            takers.push_back(k);
            k++;
            check();
        }
        if(query.type == 2){
            n -= query.number;
            check();
        }
        if(query.type == 3){
            n += query.number;
            int idx = -1;
            rep(i, m) if(query.name == names[i]) idx = i;
            auto itr = find(takers.begin(), takers.end(), idx);
            if(itr != takers.end()){
                takers.erase(itr);
                fixers.push_back(idx);
            }
        }
    }
    for(auto name : home){
        cout << name << "\n";
    }
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0