結果
問題 | No.2957 Combo Deck Builder |
ユーザー |
|
提出日時 | 2024-11-08 22:42:22 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 302 ms / 1,000 ms |
コード長 | 3,127 bytes |
コンパイル時間 | 6,900 ms |
コンパイル使用メモリ | 336,396 KB |
実行使用メモリ | 25,708 KB |
最終ジャッジ日時 | 2024-11-08 22:42:43 |
合計ジャッジ時間 | 16,070 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 38 |
ソースコード
//https://atcoder.jp/contests/aising2020/submissions/59445625#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;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 <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}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" : " "); returnos;}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){returntrue;}); 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);}int solve(){int n;cin >> n;vector<vector<long long>> x_great(n + 1);vector<vector<long long>> y_great(n + 1);long long ans = 0;rep(i, n){int k, x, y;cin >> k >> y >> x;int c = n - k;int guarantee = min(x, y);ans += guarantee;x -= guarantee;y -= guarantee;if(x > 0){x_great[c].push_back(x);}if(y > 0){y_great[n - c].push_back(y);}}auto solve = [&](vector<vector<long long>> schedule){long long res = 0;priority_queue<long long> pq;rep(i, n){for(long long val : schedule[i]) pq.push(val);if(pq.size()){long long val = pq.top(); pq.pop();res += val;}}return res;};ans += solve(x_great);ans += solve(y_great);cout << ans << "\n";return 0;}int main(){solve();return 0;}