제출 #1241471

#제출 시각아이디문제언어결과실행 시간메모리
1241471aren_danceBikeparking (EGOI24_bikeparking)C++20
25 / 100
77 ms4936 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];
    }
    long long sum=0ll;
    for(int i=1;i<=n;++i){
        cin>>y[i];
        sum+=y[i];
    }
    int vel=2;
    long long answ=0ll;
    for(int i=1;i<=n;++i){
        if(vel==i){
            ++vel;
        }
        for(;vel<=n;++vel){
            if(x[i]<y[vel]){
                y[vel]-=x[i];
                answ+=x[i];
                x[i]=0ll;
                break;
            }
            else{
                x[i]-=y[vel];
                answ+=y[vel];
                y[vel]=0;
            }
        }
        y[i]=max(0ll,y[i]-x[i]);
    }
    for(int i=1;i<=n;++i){
        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...