結果

問題 No.2957 Combo Deck Builder
ユーザー 👑 binapbinap
提出日時 2024-10-29 11:16:49
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
TLE  
実行時間 -
コード長 4,091 bytes
コンパイル時間 4,563 ms
コンパイル使用メモリ 268,576 KB
実行使用メモリ 9,244 KB
最終ジャッジ日時 2024-10-30 18:43:38
合計ジャッジ時間 72,954 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 TLE -
testcase_01 TLE -
testcase_02 TLE -
testcase_03 TLE -
testcase_04 TLE -
testcase_05 TLE -
testcase_06 TLE -
testcase_07 TLE -
testcase_08 TLE -
testcase_09 TLE -
testcase_10 TLE -
testcase_11 TLE -
testcase_12 TLE -
testcase_13 TLE -
testcase_14 TLE -
testcase_15 TLE -
testcase_16 TLE -
testcase_17 TLE -
testcase_18 TLE -
testcase_19 TLE -
testcase_20 TLE -
testcase_21 TLE -
testcase_22 TLE -
testcase_23 TLE -
testcase_24 TLE -
testcase_25 TLE -
testcase_26 TLE -
testcase_27 TLE -
testcase_28 TLE -
testcase_29 TLE -
testcase_30 TLE -
testcase_31 TLE -
testcase_32 AC 997 ms
7,372 KB
testcase_33 TLE -
testcase_34 TLE -
testcase_35 TLE -
testcase_36 AC 802 ms
6,820 KB
testcase_37 TLE -
testcase_38 TLE -
testcase_39 AC 802 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);}

random_device seed;
mt19937 mt(seed());

const int INF = 100000;

int main(){
	int n;
	cin >> n;
	
	vector<pair<int, int>> x_great;
	vector<pair<int, int>> y_great;
	
	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.emplace_back(c, x);
		}
		if(y > 0){
			y_great.emplace_back(n - c, y);
		}
	}
	
	auto solve = [&](vector<pair<int, int>> schedule){
		long long score = 0;
		long long score_max = 0;
		
		int m = schedule.size();
		if(m == 0) return 0LL;
		
		auto f = [&](int i, int d){
			if(d >= schedule[i].first) return schedule[i].second;
			else return 0;
		};
		
		uniform_int_distribution<> dist(0, m - 1);
		
		vector<int> solution(m);
		// initial_solution
		rep(i, m) solution[i] = (n - m) + i;
		rep(i, m) score += f(i, solution[i]);
		
		// annealing
		int loop_cnt = 0;
		chrono::system_clock::time_point start = chrono::system_clock::now();
		
		double TL = 800;
		double temp_start = 1000000000;
		double temp_end = 1;
		
		while(true){
			chrono::system_clock::time_point now = chrono::system_clock::now();
			double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(now - start).count();
			if(elapsed >= TL) break;
			
			
			int i = dist(mt);
			int j = dist(mt);
			long long delta_score = -(f(i, solution[i]) + f(j, solution[j])) + (f(i, solution[j]) + f(j, solution[i]));
			
			double temp = temp_start + (temp_end - temp_start) * elapsed / TL;
			double prob = exp(delta_score / temp);
			
			if(prob > (rand() % INF)/((double)INF)){
				swap(solution[i], solution[j]);
				score += delta_score;
				chmax(score_max, score);
			}
		}
		return score_max;
	};
	
	ans += solve(x_great);
	ans += solve(y_great);
	
	cout << ans << "\n";
	return 0;
}
0