Submission #463472

#	Time	Username	Problem	Language	Result	Execution time	Memory
463472		zaneyu	금 캐기 (IZhO14_divide)	C++14	100 / 100	291 ms	193028 KiB

divide

/*input
4
0 5 1
1 7 2
4 4 1
7 15 1
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<int,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=1e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
int mult(ll a,ll b){
    if(a<0) a+=MOD;
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
ll pg[maxn],pd[maxn];
int x[maxn];
#define int ll
struct node{
    ll mx=0;
    int lc=0,rc=0;
}seg[80*maxn];
//check this line
int tot=2;
inline void mdf(int &idx,int l,int r,int p,int x){
    if(!idx){
        idx=(tot++);
    }
    if(r<p or l>p) return;
    if(l==r){
        MNTO(seg[idx].mx,x);
        return;
    }
    int mid=(l+r)/2;
    mdf(seg[idx].lc,l,mid,p,x);
    mdf(seg[idx].rc,mid+1,r,p,x);
    seg[idx].mx=min(seg[seg[idx].lc].mx,seg[seg[idx].rc].mx);
}
inline ll query(int &idx,int l,int r,int ql,int qr){
    if(r<ql or l>qr) return INF64;
    if(!idx){
        idx=(tot++);
    }
    if(ql<=l and r<=qr){
        return seg[idx].mx;
    }
    int mid=(l+r)/2;
    return min(query(seg[idx].lc,l,mid,ql,qr),query(seg[idx].rc,mid+1,r,ql,qr));
}
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n;
    cin>>n;
    REP(i,80*maxn) seg[i].mx=INF64;
    ll ans=0;
    int rt=1;
    ll asd=INF64/2;
    REP1(i,n){
        int g,d;
        cin>>x[i]>>g>>d;
        pg[i]=pg[i-1]+g,pd[i]=pd[i-1]+d;
        //pd[i]-x[i]-(pd[j-1]-x[j])>=0;
        mdf(rt,0,INF64-1,pd[i-1]-x[i]+asd,pg[i-1]);
        MXTO(ans,pg[i]-query(rt,0,INF64-1,0,pd[i]-x[i]+asd));
    }
    cout<<ans;
}   

• Subtask 1: 17 / 17
• Subtask 2: 31 / 31
• Subtask 3: 52 / 52