結果

問題 No.2957 Combo Deck Builder
ユーザー 👑 binapbinap
提出日時 2024-10-29 10:57:32
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 3,816 bytes
コンパイル時間 4,595 ms
コンパイル使用メモリ 268,388 KB
実行使用メモリ 647,800 KB
最終ジャッジ日時 2024-10-30 18:42:38
合計ジャッジ時間 56,482 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample TLE * 2
other TLE * 24 MLE * 1 -- * 13
権限があれば一括ダウンロードができます

ソースコード

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());
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();
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]);
// hill climbing
int loop_cnt = 0;
chrono::system_clock::time_point start = chrono::system_clock::now();
while(true){
chrono::system_clock::time_point end = chrono::system_clock::now();
double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end-start).count();
if(elapsed >= 800) 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]));
if(delta_score >= 0){
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;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0