Submission #1172574

#TimeUsernameProblemLanguageResultExecution timeMemory
1172574ezzzayBikeparking (EGOI24_bikeparking)C++20
25 / 100
79 ms4936 KiB
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
const int N=3e5+5;
int a[N];
int b[N];
int bit[N];
signed main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=n;i++)cin>>b[i];
    int s=0;
    int j=n;
    int i=n-1;
    while(i>=1 and j>=2){
        while(b[j]>0 and i>=1){
            int x=min(a[i],b[j]);
            s+=x;
            a[i]-=x;
            b[j]-=x;
            if(a[i]==0)i--;
        }
        if(b[j]==0)j--;
        if(a[i]==0)i--;
        if(i==j)i--;
    }
    for(int i=1;i<=n;i++){
        int x=min(a[i],b[i]);
        a[i]-=x;
        b[i]-=x;
        s-=b[i];
    }
    cout<<s;
}
#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...