結果
問題 | No.2957 Combo Deck Builder |
ユーザー |
![]() |
提出日時 | 2024-11-08 23:06:21 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 205 ms / 1,000 ms |
コード長 | 3,067 bytes |
コンパイル時間 | 4,802 ms |
コンパイル使用メモリ | 319,828 KB |
実行使用メモリ | 9,828 KB |
最終ジャッジ日時 | 2024-11-08 23:06:39 |
合計ジャッジ時間 | 9,752 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 38 |
ソースコード
#include <bits/stdc++.h>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>#endifusing ll=long long;using ull=unsigned long long;using P=pair<ll,ll>;template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}#define reps(i,a,n) for(int i=(a);i<int(n);i++)#define rep(i,n) reps(i,0,n)#define all(x) x.begin(),x.end()#define pcnt(x) __builtin_popcountll(x)#define fin(x) return cout<<(x)<<'\n',static_cast<void>(0)ll myceil(ll a,ll b){return (a+b-1)/b;}template<typename T,size_t n,size_t id=0>auto vec(const int (&d)[n],const T &init=T()){if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));else return init;}#ifdef LOCAL#include<debug.h>#else#define debug(...) static_cast<void>(0)#define debugg(...) static_cast<void>(0)template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}#endifvoid SOLVE();int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout<<fixed<<setprecision(16);#ifdef LOCALclock_t start=clock();#endifint testcase=1;//cin>>testcase;for(int i=0;i<testcase;i++){SOLVE();}#ifdef LOCALcerr<<"time:";cerr<<(clock()-start)/1000;cerr<<"ms\n";#endif}void SOLVE(){int n;cin>>n;ll ans=0;vector<pair<int,ll>>left,right;rep(i,n){int c;ll x,y;cin>>c>>x>>y;if(x==y){ans+=x;continue;}if(c==0){ans+=x;continue;}if(c==n){ans+=y;continue;}if(x<y){ans+=x;left.push_back({c,y-x});}else{ans+=y;right.push_back({c,x-y});}}vector<ll>a(n,-1);sort(all(left));priority_queue<ll>que;for(int i=n-1,j=(int)left.size();i>=0;i--){while(j>0&&left[j-1].first>i){que.push(left[--j].second);}if(que.empty())continue;ll x=que.top();que.pop();a[i]=x;ans+=x;}while(!que.empty())que.pop();for(int i=0,j=0;i<n;i++){if(a[i]!=-1)a[j++]=a[i];}sort(all(right));vector<ll>b(n,-1);for(int i=0,j=0;i<n;i++){while(j<right.size()&&right[j].first<=i){que.push(right[j++].second);}if(que.empty())continue;ll x=que.top();que.pop();b[i]=x;ans+=x;}for(int i=n-1,j=n-1;i>=0;i--)if(b[i]!=-1)b[j--]=b[i];cout<<ans<<endl;}