結果

問題 No.2957 Combo Deck Builder
ユーザー 👑 binap
提出日時 2024-10-21 06:41:01
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,040 bytes
コンパイル時間 4,499 ms
コンパイル使用メモリ 257,344 KB
最終ジャッジ日時 2025-02-24 22:09:18
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 11 WA * 27
権限があれば一括ダウンロードができます

ソースコード

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

// False Answer
int main(){
	int n;
	cin >> n;
	
	vector<pair<int, int>> x_great;
	vector<pair<int, int>> y_great;
	
	long long ans = 0;
	
	auto solve = [&](vector<pair<int, int>> vec){
		sort(vec.begin(), vec.end(), [](pair<int, int> p1, pair<int, int> p2){
			if(p1.first == p2.first) return p1.second < p2.second;
			return p1.first > p2.first;
		});
		long long res = 0;
		int day = n - 1;
		for(auto [d, c] : vec){
			if(c <= day){
				res += d;
				day--;
			}
		}
		return res;
	};
	
	rep(i, n){
		int c, x, y;
		cin >> c >> x >> y;
		
		if(x >= y){
			ans += y;
			x_great.emplace_back(x - y, c);
		}
		if(x < y){
			ans += x;
			y_great.emplace_back(y - x, n - c);
		}
	}
	
	ans += solve(x_great);
	ans += solve(y_great);
	
	cout << ans << "\n";
	return 0;
}
0