結果
問題 | No.1826 Fruits Collecting |
ユーザー |
|
提出日時 | 2022-01-28 21:40:33 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 313 ms / 2,000 ms |
コード長 | 4,077 bytes |
コンパイル時間 | 2,219 ms |
コンパイル使用メモリ | 210,256 KB |
最終ジャッジ日時 | 2025-01-27 16:18:12 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 43 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(long long i=0;i<(long long)(n);i++)#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)#define pb emplace_back#define lb(v,k) (lower_bound(all(v),(k))-v.begin())#define ub(v,k) (upper_bound(all(v),(k))-v.begin())#define fi first#define se second#define pi M_PI#define PQ(T) priority_queue<T>#define SPQ(T) priority_queue<T,vector<T>,greater<T>>#define dame(a) {out(a);return 0;}#define decimal cout<<fixed<<setprecision(15);#define all(a) a.begin(),a.end()#define rsort(a) {sort(all(a));reverse(all(a));}#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}#define popcnt __builtin_popcountlltypedef long long ll;typedef pair<ll,ll> P;typedef tuple<ll,ll,ll> PP;typedef tuple<ll,ll,ll,ll> PPP;using vi=vector<ll>;using vvi=vector<vi>;using vvvi=vector<vvi>;using vvvvi=vector<vvvi>;using vp=vector<P>;using vvp=vector<vp>;using vb=vector<bool>;using vvb=vector<vb>;const ll inf=1001001001001001001;const ll INF=1001001001;const ll mod=998244353;const double eps=1e-10;template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}template<class T> void out(T a){cout<<a<<'\n';}template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}template<class T> void yesno(T b){if(b)out("yes");else out("no");}template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}class segtree{vi seg;ll n;public:ll g=-inf;ll f(ll a,ll b){return max(a,b);}bool comp(ll x,ll cur){return x>=cur;}segtree(ll n_,ll k):n(n_){seg=vi(n*2,g);rep(i,n)seg[i+n]=k;for(ll i=n-1;i;i--)seg[i]=f(seg[i*2],seg[i*2+1]);}segtree(vi v):n(v.size()){seg=vi(n*2,g);rep(i,n)seg[i+n]=v[i];for(ll i=n-1;i;i--)seg[i]=f(seg[i*2],seg[i*2+1]);}void add(ll i,ll x){i+=n;seg[i]+=x;for(i>>=1;i;i>>=1)seg[i]=f(seg[i*2],seg[i*2+1]);}void update(ll i,ll x){i+=n;seg[i]=x;for(i>>=1;i;i>>=1)seg[i]=f(seg[i*2],seg[i*2+1]);}ll get(ll l,ll r){ll resl=g,resr=g;for(l+=n,r+=n;l<r;l>>=1,r>>=1){if(l&1)resl=f(resl,seg[l++]);if(r&1)resr=f(seg[--r],resr);}return f(resl,resr);}ll solve(ll l,ll x){ //comp(x,f([l,r])) == true を満たす最小のrll cur=g;for(l+=n;l;l>>=1)if(l&1){if(comp(x,f(cur,seg[l])))break;cur=f(cur,seg[l++]);}if(l==0)return n;while(l<n){l<<=1;if(!comp(x,f(cur,seg[l])))cur=f(cur,seg[l++]);}return l-n;}void debug(ll n){rep(i,n)cout<<' '<<seg[i+n];cout<<endl;}};int main(){ll n;cin>>n;vector<PP> v;rep(i,n){ll t,x,c;cin>>t>>x>>c;if(abs(x)<=t)v.pb(t-x,t+x,c);}if(v.size()==0)dame(0);n=v.size();sort(all(v));segtree seg(n,-inf);vp srt(n);rep(i,n)srt[i]=P(get<1>(v[i]),i);sort(all(srt));for(auto x:srt){ll ma=max(0ll,seg.get(0,x.se));seg.update(x.se,ma+get<2>(v[x.se]));}out(seg.get(0,n));}