結果

問題 No.2957 Combo Deck Builder
ユーザー hirayuu_ychirayuu_yc
提出日時 2024-11-08 22:42:22
言語 C++23(gcc13)
(gcc 13.2.0 + boost 1.83.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
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 1 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 271 ms
24,772 KB
testcase_07 AC 278 ms
24,960 KB
testcase_08 AC 274 ms
24,832 KB
testcase_09 AC 278 ms
24,832 KB
testcase_10 AC 271 ms
24,332 KB
testcase_11 AC 267 ms
24,764 KB
testcase_12 AC 302 ms
24,448 KB
testcase_13 AC 269 ms
24,532 KB
testcase_14 AC 226 ms
19,996 KB
testcase_15 AC 246 ms
20,152 KB
testcase_16 AC 234 ms
20,352 KB
testcase_17 AC 233 ms
20,224 KB
testcase_18 AC 232 ms
20,096 KB
testcase_19 AC 235 ms
20,352 KB
testcase_20 AC 251 ms
20,156 KB
testcase_21 AC 230 ms
20,096 KB
testcase_22 AC 229 ms
20,224 KB
testcase_23 AC 230 ms
20,096 KB
testcase_24 AC 226 ms
19,968 KB
testcase_25 AC 231 ms
20,096 KB
testcase_26 AC 267 ms
25,420 KB
testcase_27 AC 295 ms
25,508 KB
testcase_28 AC 274 ms
25,408 KB
testcase_29 AC 284 ms
25,708 KB
testcase_30 AC 217 ms
20,208 KB
testcase_31 AC 191 ms
20,324 KB
testcase_32 AC 242 ms
23,876 KB
testcase_33 AC 260 ms
23,484 KB
testcase_34 AC 210 ms
17,152 KB
testcase_35 AC 239 ms
17,312 KB
testcase_36 AC 2 ms
5,248 KB
testcase_37 AC 2 ms
5,248 KB
testcase_38 AC 2 ms
5,248 KB
testcase_39 AC 1 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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