結果

問題 No.2957 Combo Deck Builder
ユーザー 👑 binapbinap
提出日時 2024-10-21 06:40:05
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 304 ms / 1,000 ms
コード長 3,010 bytes
コンパイル時間 4,637 ms
コンパイル使用メモリ 266,884 KB
実行使用メモリ 25,556 KB
最終ジャッジ日時 2024-10-30 18:38:27
合計ジャッジ時間 15,003 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 2 ms
6,820 KB
testcase_05 AC 2 ms
6,816 KB
testcase_06 AC 301 ms
24,640 KB
testcase_07 AC 304 ms
24,728 KB
testcase_08 AC 301 ms
24,868 KB
testcase_09 AC 296 ms
24,580 KB
testcase_10 AC 293 ms
24,252 KB
testcase_11 AC 298 ms
24,536 KB
testcase_12 AC 294 ms
24,328 KB
testcase_13 AC 302 ms
24,656 KB
testcase_14 AC 247 ms
20,072 KB
testcase_15 AC 249 ms
20,140 KB
testcase_16 AC 249 ms
20,324 KB
testcase_17 AC 255 ms
20,204 KB
testcase_18 AC 248 ms
20,204 KB
testcase_19 AC 249 ms
20,348 KB
testcase_20 AC 249 ms
20,120 KB
testcase_21 AC 250 ms
20,104 KB
testcase_22 AC 249 ms
20,240 KB
testcase_23 AC 248 ms
20,280 KB
testcase_24 AC 244 ms
19,944 KB
testcase_25 AC 248 ms
20,148 KB
testcase_26 AC 298 ms
25,384 KB
testcase_27 AC 300 ms
25,552 KB
testcase_28 AC 302 ms
25,556 KB
testcase_29 AC 302 ms
25,452 KB
testcase_30 AC 233 ms
20,388 KB
testcase_31 AC 205 ms
20,292 KB
testcase_32 AC 237 ms
23,344 KB
testcase_33 AC 266 ms
23,948 KB
testcase_34 AC 224 ms
16,992 KB
testcase_35 AC 230 ms
17,260 KB
testcase_36 AC 2 ms
6,820 KB
testcase_37 AC 2 ms
6,820 KB
testcase_38 AC 2 ms
6,816 KB
testcase_39 AC 2 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

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;

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" : " "); 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);}

int main(){
	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 c, x, y;
		cin >> c >> x >> y;
		
		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;
}
0