Submission #862087

#	Time	Username	Problem	Language	Result	Execution time	Memory
862087		guagua0407	Two Dishes (JOI19_dishes)	C++17	100 / 100	1815 ms	286420 KiB

dishes

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int mxn=1e6+5;
ll a[mxn],S[mxn],Q[mxn];
ll b[mxn],T[mxn],P[mxn];
int pa[mxn],pb[mxn];
ll g[mxn],V[mxn];
vector<int> qa[mxn],qb[mxn];
int n,m;

int main() {_
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>a[i]>>S[i]>>P[i];
        a[i]+=a[i-1];
    }
    for(int i=1;i<=m;i++){
        cin>>b[i]>>T[i]>>Q[i];
        b[i]+=b[i-1];
    }
    for(int i=1;i<=n;i++){
        int pos=upper_bound(b,b+m+1,S[i]-a[i])-b-1;
        pa[i]=pos;
        if(pos>=0) qa[pos].push_back(i);
    }
    for(int i=1;i<=m;i++){
        int pos=upper_bound(a,a+n+1,T[i]-b[i])-a-1;
        pb[i]=pos;
        if(pos>=0) qb[pos].push_back(i);
    }
    for(int i=1;i<=m;i++){
        if(pb[i]>=0) g[i]=V[i]=Q[i];
    }
    /*for(int i=1;i<=n;i++){
        cout<<pa[i]<<' ';
    }cout<<'\n';
    for(int i=1;i<=m;i++){
        cout<<pb[i]<<' ';
    }cout<<'\n';*/
    set<int> S;
    S.insert(m+1);
    V[m+1]=-1e18;
    for(int i=1;i<=n;i++){
        vector<int> vec;
        if(pa[i]>=0){
            g[0]+=P[i];
            g[pa[i]+1]-=P[i];
            if(g[pa[i]+1]>V[pa[i]+1] or g[pa[i]+1]<V[pa[i]+1]){
                if(pa[i]+1<=m) S.insert(pa[i]+1);
            }
            if(g[pa[i]+1]<V[pa[i]+1]){
                if(pa[i]+1<=m) vec.push_back(pa[i]+1);
            }
        }
        for(auto v:qb[i-1]){
            if(g[v]>0 or g[v]<0){
                S.insert(v);
            }
            if(g[v]<0){
                vec.push_back(v);
            }
            V[v]=0;
        }
        sort(all(vec));
        /*for(auto v:vec){
            cout<<v<<' ';
        }cout<<'\n';
        for(auto v:S){
            cout<<v<<' ';
        }cout<<'\n';*/
        for(auto v:vec){
            auto it=S.lower_bound(v);
            if((*it)!=v) continue;
            if(g[*it]==V[*it]) S.erase(it);
            if(g[*it]>=V[*it]) continue;
            while(true){
                int cur=*it;
                ll dif=V[cur]-g[cur];
                int nxt=*next(it);
                g[cur]=V[cur];
                g[nxt]-=dif;
                if(g[nxt]>=V[nxt]){
                    S.erase(it);
                    if(g[nxt]==V[nxt]) S.erase(S.find(nxt));
                    break;
                }
                else{
                    it=S.erase(it);
                }
            }
        }
        /*for(auto v:S){
            cout<<v<<' ';
        }cout<<'\n';
        ll sum=0;
        for(int i=0;i<=m;i++){
            if(i!=0) cout<<g[i]+sum<<' ';
            sum+=g[i];
        }cout<<'\n';*/
    }
    for(int i=1;i<=m;i++){
        g[i]+=g[i-1];
    }
    cout<<g[m]<<'\n';
    return 0;
}
//maybe its multiset not set

Compilation message (stderr)

dishes.cpp: In function 'void setIO(std::string)':
dishes.cpp:12:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:13:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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