#734995 (C++17) No.1826 Fruits Collecting

• 問題: No.1826 Fruits Collecting
• ユーザー: blackyuki
• 提出日時: 2022-01-28 21:40:33
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 257 ms / 2,000 ms
• コード長: 4,077 bytes
• コンパイル時間: 2,715 ms
• コンパイル使用メモリ: 218,684 KB
• 実行使用メモリ: 12,724 KB
• 最終ジャッジ日時: 2024-06-09 14:38:50
• 合計ジャッジ時間: 9,422 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	3 ms; 6,816 KB
testcase_01	AC	3 ms; 6,940 KB
testcase_02	AC	3 ms; 6,944 KB
testcase_03	AC	4 ms; 6,944 KB
testcase_04	AC	3 ms; 6,944 KB
testcase_05	AC	105 ms; 6,940 KB
testcase_06	AC	165 ms; 6,944 KB
testcase_07	AC	125 ms; 6,944 KB
testcase_08	AC	14 ms; 6,940 KB
testcase_09	AC	162 ms; 6,944 KB
testcase_10	AC	112 ms; 6,944 KB
testcase_11	AC	108 ms; 6,944 KB
testcase_12	AC	46 ms; 6,944 KB
testcase_13	AC	23 ms; 6,944 KB
testcase_14	AC	36 ms; 6,944 KB
testcase_15	AC	257 ms; 8,784 KB
testcase_16	AC	256 ms; 8,784 KB
testcase_17	AC	253 ms; 8,844 KB
testcase_18	AC	249 ms; 8,784 KB
testcase_19	AC	249 ms; 8,784 KB
testcase_20	AC	251 ms; 9,428 KB
testcase_21	AC	255 ms; 8,768 KB
testcase_22	AC	249 ms; 8,908 KB
testcase_23	AC	255 ms; 8,784 KB
testcase_24	AC	255 ms; 8,652 KB
testcase_25	AC	2 ms; 6,944 KB
testcase_26	AC	2 ms; 6,940 KB
testcase_27	AC	2 ms; 6,944 KB
testcase_28	AC	2 ms; 6,940 KB
testcase_29	AC	1 ms; 6,940 KB
testcase_30	AC	53 ms; 6,944 KB
testcase_31	AC	103 ms; 6,940 KB
testcase_32	AC	60 ms; 6,944 KB
testcase_33	AC	192 ms; 10,956 KB
testcase_34	AC	166 ms; 9,680 KB
testcase_35	AC	39 ms; 6,944 KB
testcase_36	AC	186 ms; 11,620 KB
testcase_37	AC	118 ms; 9,296 KB
testcase_38	AC	85 ms; 7,920 KB
testcase_39	AC	172 ms; 11,260 KB
testcase_40	AC	207 ms; 12,724 KB
testcase_41	AC	46 ms; 6,940 KB
testcase_42	AC	8 ms; 6,944 KB
testcase_43	AC	1 ms; 6,944 KB
testcase_44	AC	1 ms; 6,944 KB
testcase_45	AC	1 ms; 6,944 KB

ソースコード

#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_popcountll
typedef 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 を満たす最小のr
        ll 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));
}