Submission #1058405

#TimeUsernameProblemLanguageResultExecution timeMemory
1058405user736482Bikeparking (EGOI24_bikeparking)C++17
25 / 100
26 ms11964 KiB
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,t,n,x,y,m,q;
vector<long long>v1,v2;
stack<long long>s;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n;
    long long res=0;
    for(long long i=0;i<n;i++){
        cin>>a;
        v1.push_back(a);
    }
    for(long long i=0;i<n;i++){
        cin>>a;
        v2.push_back(a);
    }
    if(a)
    s.push(a);
    long long pt1=n-1,pt2=n-1;
    //return 0;
    while(pt1>=0){
            //cout<<pt1<<" "<<pt2<<"   ";
        if(pt1>=pt2 || v1[pt1]==0){
            pt1--;
            continue;

        }
        while(pt2-1>pt1){
            pt2--;
            if(v2[pt2])
                s.push(v2[pt2]);
        }
        if(s.empty()){
                pt2--;
        if(v2[pt2])
                s.push(v2[pt2]);
            continue;}
        v2[pt2]=s.top();
        s.pop();
        if(v2[pt2]>=v1[pt1]){
            v2[pt2]-=v1[pt1];
            res+=v1[pt1];
            v1[pt1]=0;
        }
        else{
            v1[pt1]-=v2[pt2];
            res+=v2[pt2];
            v2[pt2]=0;
        }
        pt2++;
        while(pt2-1>pt1){
            pt2--;
            if(v2[pt2])
                s.push(v2[pt2]);
        }
    }
    //return 0;
    //v2[pt2]-=min(v2[pt2],v1[pt2]);
    //cout<<res;
    pt2=n-1;
    while(pt2>=0){
        res-=max(0LL,(long long)(v2[pt2]-v1[pt2]));
        pt2--;

    }
    cout<<res;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...