Submission #417994

#	Time	Username	Problem	Language	Result	Execution time	Memory
417994		Runtime_error_	Divide and conquer (IZhO14_divide)	C++14	100 / 100	164 ms	22064 KiB

divide

#include <bits/stdc++.h>
#define ll long long
#define le node+node
#define ri node+node+1
#define mid (l+r)/2
using namespace std;
const ll inf = 2e5+9,MX = 1e18+9;
ll n,ans,x[inf],g[inf],e[inf];

ll cnt;
map<ll,ll> compress;

ll tree[inf<<2];

void build(ll node,ll l,ll r){
    if(l == r)
        return void(tree[node] = MX);
    build(le,l,mid);
    build(ri,mid+1,r);
    tree[node] = min(tree[le],tree[ri]);
}

void update(ll node,ll l,ll r,ll idx,ll val){
    if(l == r)
        return void(tree[node] = min(tree[node],val));
    if(idx <= mid)
        update(le,l,mid,idx,val);
    else
        update(ri,mid+1,r,idx,val);
    tree[node] = min(tree[le],tree[ri]);
}

ll query(ll node,ll l,ll r,ll x,ll y){
    if(l>r || r<x || l>y || x>y)
        return MX;
    if(l>=x && r<=y)
        return tree[node];
    return min(query(le,l,mid,x,y),query(ri,mid+1,r,x,y));
}

signed main(){
    scanf("%lld",&n);
    for(ll i=1;i<=n;i++)
        scanf("%lld%lld%lld",x+i,g+i,e+i),g[i] += g[i-1],
        e[i] += e[i-1],compress[e[i]-x[i]],compress[e[i-1]-x[i]];
    for(auto &o:compress)
        o.second = ++cnt;
    build(1,1,cnt);
    for(ll i=1;i<=n;i++){
        update(1,1,cnt,compress[ e[i-1]-x[i] ],g[i-1]);
        ans = max(ans,g[i]-query(1,1,cnt,1,compress[ e[i]-x[i] ]));
    }
    printf("%lld\n",ans);
}

Compilation message (stderr)

divide.cpp: In function 'int main()':
divide.cpp:43:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     scanf("%lld",&n);
      |     ~~~~~^~~~~~~~~~~
divide.cpp:45:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |         scanf("%lld%lld%lld",x+i,g+i,e+i),g[i] += g[i-1],
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

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