結果
問題 | No.2957 Combo Deck Builder |
ユーザー |
👑 ![]() |
提出日時 | 2025-01-16 01:39:49 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 300 ms / 1,000 ms |
コード長 | 3,850 bytes |
コンパイル時間 | 5,132 ms |
コンパイル使用メモリ | 184,684 KB |
実行使用メモリ | 22,240 KB |
最終ジャッジ日時 | 2025-01-16 01:40:06 |
合計ジャッジ時間 | 13,972 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 38 |
ソースコード
#include <algorithm>#include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>using mint = modint998244353;template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}int main() {ll N;cin >> N;vector<ll> C(N);vector<ll> X(N);vector<ll> Y(N);for (ll i = 0; i < N; i++) {cin >> C[i] >> X[i] >> Y[i];}ll point = 0;ll large = 0;ll small = 0;ll same = 0;vector<vector<ll>> large_vec(N + 1, vector<ll>(0));vector<vector<ll>> small_vec(N + 1, vector<ll>(0));for (ll i = 0; i < N; i++) {if (X[i] > Y[i]) {large++;point += Y[i];large_vec[C[i]].push_back(X[i] - Y[i]);} else if (X[i] < Y[i]) {small++;point += X[i];small_vec[N - C[i]].push_back(Y[i] - X[i]);} else {same++;point += X[i];}}priority_queue<ll> pque1;for (ll i = 0; i < N; i++) {for (ll j = 0; j < large_vec[i].size(); j++) {pque1.push(large_vec[i][j]);}if (pque1.size()) {ll tp = pque1.top();pque1.pop();point += tp;}}priority_queue<ll> pque2;for (ll i = 0; i < N; i++) {for (ll j = 0; j < small_vec[i].size(); j++) {pque2.push(small_vec[i][j]);}if (pque2.size()) {ll tp = pque2.top();pque2.pop();point += tp;}}cout << point << endl;}