Submission #1058165

#	Time	Username	Problem	Language	Result	Execution time	Memory
1058165		kachim2	Bikeparking (EGOI24_bikeparking)	C++17	25 / 100	77 ms	5116 KiB

Main

#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 j = 1;
    ll happy = 0;
    ll stage = 0;
    for(ll i = 0; i < n; i++){
        if(j==i){
            j++;
        }
        while(slots[i]!=0){
            if(j==n) {stage = 1; break;}
            ll x = min(slots[i], users[j]);
            slots[i]-=x;
            users[j]-=x;
            happy+=x;
            if(users[j]==0){
                j++;
            }
        }
        if(stage == 1) {
            ll x = min(slots[i], users[i]);
            slots[i]-=x;
            users[i]-=x;



            break;
        }
    }
    happy -= accumulate(users.begin(), users.end(), ll(0));
    cout << happy;
}

• Subtask 1: 16 / 16
• Subtask 2: 9 / 9
• Subtask 3: 0 / 19
• Subtask 4: 0 / 24
• Subtask 5: 0 / 32