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

• 問題: No.2804 Fixer And Ratism
• ユーザー: Aeren
• 提出日時: 2024-07-12 21:51:45
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: RE
• 実行時間: -
• コード長: 2,343 bytes
• コンパイル時間: 3,884 ms
• コンパイル使用メモリ: 272,904 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-07-12 21:51:54
• 合計ジャッジ時間: 8,415 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,940 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	RE	-
testcase_04	RE	-
testcase_05	RE	-
testcase_06	RE	-
testcase_07	RE	-
testcase_08	RE	-
testcase_09	RE	-
testcase_10	RE	-
testcase_11	AC	19 ms; 6,940 KB
testcase_12	RE	-
testcase_13	AC	6 ms; 6,940 KB
testcase_14	RE	-
testcase_15	RE	-
testcase_16	RE	-
testcase_17	RE	-
testcase_18	RE	-
testcase_19	RE	-
testcase_20	RE	-
testcase_21	AC	23 ms; 6,944 KB
testcase_22	RE	-
testcase_23	RE	-
testcase_24	RE	-
testcase_25	AC	29 ms; 6,940 KB
testcase_26	RE	-
testcase_27	RE	-
testcase_28	AC	29 ms; 6,944 KB
testcase_29	RE	-
testcase_30	RE	-
testcase_31	RE	-
testcase_32	RE	-
testcase_33	AC	2 ms; 6,944 KB

ソースコード

// #include <bits/allocator.h> // Temp fix for gcc13 global pragma
// #pragma GCC target("avx2,bmi2,popcnt,lzcnt")
// #pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
// #include <x86intrin.h>
using namespace std;
#if __cplusplus >= 202002L
using namespace numbers;
#endif
#ifdef LOCAL
	#include "Debug.h"
#else
	#define debug_endl() 42
	#define debug(...) 42
	#define debug2(...) 42
	#define debugbin(...) 42
#endif



int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(ios::badbit | ios::failbit);
	int computer, qn;
	cin >> computer >> qn;
	set<string> did_contribute, left;
	map<string, int> rating_of;
	vector<pair<int, string>> contributed;
	vector<pair<int, string>> useless;
	vector<string> res;
	for(auto qi = 0; qi < qn; ++ qi){
		int type;
		cin >> type;
		if(type == 1){
			string name;
			int r;
			cin >> name >> r;
			useless.insert(partition_point(useless.begin(), useless.end(), [&](auto &x){ return x.first > r; }), pair{r, name});
		}
		else if(type == 2){
			int x;
			cin >> x;
			computer -= x;
			assert(computer >= 1);
		}
		else{
			string name;
			int x;
			cin >> name >> x;
			computer += x;
			assert(!left.contains(name));
			if(!did_contribute.contains(name)){
				did_contribute.insert(name);
				int r = rating_of[name];
				useless.erase(partition_point(useless.begin(), useless.end(), [&](auto &x){ return x.first > r; }));
				contributed.insert(partition_point(contributed.begin(), contributed.end(), [&](auto &x){ return x.first > r; }), pair{r, name});
			}
		}
		if((int)contributed.size() + (int)useless.size() <= computer){
			continue;
		}
		if((int)contributed.size() <= computer){
			int size = min((int)useless.size(), computer - (int)contributed.size());
			while((int)useless.size() > size){
				res.push_back(useless.back().second);
				useless.pop_back();
				left.insert(res.back());
			}
		}
		else{
			while((int)contributed.size() > computer || !useless.empty()){
				if(useless.empty() || (int)contributed.size() > computer && contributed.back().first < useless.back().first){
					res.push_back(contributed.back().second);
					contributed.pop_back();
				}
				else{
					res.push_back(useless.back().second);
					useless.pop_back();
				}
				left.insert(res.back());
			}
		}
	}
	ranges::copy(res, ostream_iterator<string>(cout, "\n"));
	return 0;
}

/*

*/