Submission #1241430

#TimeUsernameProblemLanguageResultExecution timeMemory
1241430aren_danceBikeparking (EGOI24_bikeparking)C++20
25 / 100
75 ms4960 KiB
#include <bits/stdc++.h>
using namespace std;
const int N=6e5;
int n;
long long x[N];
long long y[N];
long long suf[N];
int main()
{
    cin>>n;
    for(int i=1;i<=n;++i){
        cin>>x[i];
    }
    for(int i=1;i<=n;++i){
        cin>>y[i];
    }
    int vel=n;
    long long answ=0ll;
    for(int i=n;i>0;--i){
        int c=min(vel,i-1);
        for(;c>0;--c){
            if(y[i]==0){
                break;
            }
            long long p=min(x[c],y[i]);
            y[i]-=p;
            x[c]-=p;
            answ+=p;
        }
        vel=c;
        long long p=min(x[i],y[i]);
        y[i]-=p;
        x[i]-=p;
        answ-=y[i];
    }
    cout<<answ;
    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...