Submission #1341200

#TimeUsernameProblemLanguageResultExecution timeMemory
1341200sallyBikeparking (EGOI24_bikeparking)C++20
25 / 100
105 ms2756 KiB
#include<iostream>
#include<vector>
using namespace std;
int main() {
    int N;
    cin>>N;
    vector<int> slot(N+1), person(N+1);
    for(int i=0; i<N; i++) cin>>slot[i];
    for(int i=0; i<N; i++) cin>>person[i];
    int ptr = 0, ans = 0;
    for(int i=0; i<N; i++) {
        int need = person[i];
        for(; ptr<i; ptr++) {
            if(need == 0) break;
            int take = min(need, slot[ptr]);
            slot[ptr] -= take;
            need -= take;
            ans += take;
        }
        person[i] = need;
    }
    int cnt = 0;
    for(int i=0; i<N; i++) {
        person[i] -= min(slot[i], person[i]);
    }
    for(int i=0; i<N; i++) {
        ans -= person[i];
    }
    cout<<ans;
}
#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...