제출 #1058317

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1058317		Szymon_Pilipczuk	Bikeparking (EGOI24_bikeparking)	C++17	44 / 100	69 ms	4436 KiB

Main

#include <iostream>
using namespace std;
int main()
{
    int n;
    cin>>n;
    int slots[n];
    int people[n];
    int population = 0;
    for(int i = 0;i<n;i++)
    {
        cin>>slots[i];
    }
    for(int i = 0;i<n;i++)
    {
        cin>>people[i];
        population+=people[i];
    }
    int free = 0;
    int rating = 0;
    int u;
    for(int i = 0;i<n;i++)
    {
        u = min(free,people[i]);
        free-=u;
        people[i]-=u;
        population-=u;
        rating+=u;
        if(slots[i]>people[i])
        {
            free+=slots[i]-people[i];
            slots[i] = people[i];
        }
    }
    free = 0;
    for(int i  = 0;i<n;i++)
    {
        population -= people[i];
        u = min(free,people[i]);
        free -=u;
        people[i]-=u;
        rating+=u;

        if(slots[i]>population)
        {
            free= population;
            rating -=max(people[i]-(slots[i]-population),0);
        }
        else
        {
            free+=slots[i];
            rating-=people[i];
        }



    }
    cout<<rating;
}

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