제출 #1276362

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1276362		imarn	Two Dishes (JOI19_dishes)	C++20	0 / 100	302 ms	32352 KiB

dishes

//#include "festival.h"
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
#define lb(x,i) lower_bound(all(x),i)-x.begin()
#define sz(x) (ll)x.size()
#define cd complex<double>
#define t3 tuple<int,int,int>
using namespace std;
const int mxn=1e6+5;ll inf=1e9+7;
ll qs[mxn]{0},qt[mxn]{0};
ll s[mxn],t[mxn],p[mxn],q[mxn],rs=0;
ll sg[4*mxn]{0},lz[4*mxn]{0};
void push(int i,int l,int r){
    sg[i]+=lz[i];
    if(l<r)lz[2*i]+=lz[i],lz[2*i+1]+=lz[i];
    lz[i]=0;
}
void update(int i,int l,int r,int tl,int tr,ll v){
    push(i,l,r);
    if(r<tl||l>tr)return;
    if(r<=tr&&l>=tl){
        lz[i]+=v;push(i,l,r);return;
    }int m=(l+r)>>1;
    update(2*i,l,m,tl,tr,v);update(2*i+1,m+1,r,tl,tr,v);
    sg[i]=max(sg[2*i],sg[2*i+1]);
}
void update2(int i,int l,int r,int idx,ll v){
    push(i,l,r);
    if(r<idx||l>idx)return;
    if(l==r){
        sg[i]=max(sg[i],v);return;
    }
    int m=(l+r)>>1;
    update2(2*i,l,m,idx,v);update2(2*i+1,m+1,r,idx,v);
    sg[i]=max(sg[2*i],sg[2*i+1]);
}
ll qr(int i,int l,int r,int tl,int tr){
    push(i,l,r);
    if(r<tl||l>tr)return -1e16;
    if(r<=tr&&l>=tl)return sg[i];
    int m=(l+r)>>1;
    return max(qr(2*i,l,m,tl,tr),qr(2*i+1,m+1,r,tl,tr));
}
map<pii,ll>upd;
int main(){
    ios_base::sync_with_stdio(0);
    int n,m;cin>>n>>m;
    for(int i=1;i<=n;i++)cin>>qs[i]>>s[i]>>p[i],qs[i]+=qs[i-1];
    for(int i=1;i<=m;i++)cin>>qt[i]>>t[i]>>q[i],qt[i]+=qt[i-1];
    for(int i=1;i<=n;i++){
        if(qs[i]>s[i])continue;
        if(qs[i]+qt[m]<=s[i]){rs+=p[i];continue;}
        int id=upper_bound(qt+1,qt+m+1,s[i]-qs[i])-qt-1;
        upd[{i-1,-(id+1)}]+=p[i];
    }for(int i=1;i<=m;i++){
        if(qt[i]>t[i])continue;
        if(qs[n]+qt[i]<=t[i]){rs+=q[i];continue;}
        int id=upper_bound(qs+1,qs+n+1,t[i]-qt[i])-qs-1;
        upd[{id,-i}]=-q[i];
        rs+=q[i];
    }
    for(auto [_,v] : upd){
        auto [x,y]=_;
        ll res=qr(1,0,m,0,-y-1);
        update2(1,0,m,-y,res);
        update(1,0,m,0,-y-1,v);
    }cout<<rs+qr(1,0,m,0,m);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 3
• Subtask 3: 0 / 7
• Subtask 4: 0 / 39
• Subtask 5: 0 / 11
• Subtask 6: 0 / 9
• Subtask 7: 0 / 17
• Subtask 8: 0 / 9