Submission #1058552

#TimeUsernameProblemLanguageResultExecution timeMemory
1058552kachim2Bikeparking (EGOI24_bikeparking)C++17
100 / 100
76 ms6908 KiB
#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll;
int main()
{
    ll n;
    cin >> n;
    vector<ll> slots(n);
    vector<ll> users(n);
    for (ll i = 0; i < n; i++)
    {
        cin >> slots[i];
    }
    for (ll i = 0; i < n; i++)
    {
        cin >> users[i];
    }
    ll happy = 0;
    ll wanting = 0;
    ll satisfiable = 0;
    for(int i = n-1; i >= 0; i--){
        ll x1 = min(wanting, slots[i]);
        slots[i]-=x1;
        wanting-=x1;
        ll x2 = min(satisfiable, slots[i]);
        slots[i]-=x2;
        satisfiable-=x2;
        happy+=x1+x2;

        satisfiable+=min(users[i], slots[i]);
        wanting+=users[i]-min(users[i], slots[i]);
    }

    cout << happy-wanting;
}
#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...